Diabetes Technology & Therapeutics, ISSN 1520-9156, 02/2019, Volume 21, Issue S1, pp. A-1 - A-164

Journal Article

Applied Mathematics Letters, ISSN 0893-9659, 10/2012, Volume 25, Issue 10, pp. 1444 - 1446

We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.

Few leaves | Spanning tree | Bounded degree | MATHEMATICS, APPLIED | Mathematics - Combinatorics

Few leaves | Spanning tree | Bounded degree | MATHEMATICS, APPLIED | Mathematics - Combinatorics

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2019, Volume 265, pp. 142 - 157

In this paper, we study the concept of convex domination in maximal outerplanar graphs. For this class of graphs, we discuss several properties of this...

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Journal Article

Journal of Interconnection Networks, ISSN 0219-2659, 09/2017, Volume 17, Issue 3-4

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 12/2012, Volume 160, Issue 18, pp. 2694 - 2697

Let ϕ be a 2-coloring of the elements of a matroid M. The bicolor basis graph of M is the graph G(B(M),ϕ) with vertex set given by the set of bases of M in...

Tree graph | Basis graph | SPANNING-TREES | MATHEMATICS, APPLIED | Circuits | Mathematical analysis | Graphs

Tree graph | Basis graph | SPANNING-TREES | MATHEMATICS, APPLIED | Circuits | Mathematical analysis | Graphs

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2017, Volume 37, Issue 2, pp. 383 - 397

A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ (G) denote...

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 01/2013, Volume 46, Issue 1, pp. 1 - 6

Let P be a set of n⩾3 points in general position in the plane and let G be a geometric graph with vertex set P. If the number of empty triangles Δuvw in P for...

Geometric graph | Plane tree | Empty triangle | MATHEMATICS | MATHEMATICS, APPLIED | Computational geometry | Graphs | Graph theory | Planes | Triangles

Geometric graph | Plane tree | Empty triangle | MATHEMATICS | MATHEMATICS, APPLIED | Computational geometry | Graphs | Graph theory | Planes | Triangles

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 9/2013, Volume 29, Issue 5, pp. 1517 - 1522

The heterochromatic number h c (H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k...

Mathematics | Engineering Design | Combinatorics | Geometric graph | Matroid | Heterochromatic | MATHEMATICS | TREES | Geometry | Graphs | Planes | Color | Grounds | Colouring | Graph theory | Combinatorial analysis | Colour | Mathematics - Combinatorics

Mathematics | Engineering Design | Combinatorics | Geometric graph | Matroid | Heterochromatic | MATHEMATICS | TREES | Geometry | Graphs | Planes | Color | Grounds | Colouring | Graph theory | Combinatorial analysis | Colour | Mathematics - Combinatorics

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 09/2005, Volume 21, Issue 3, pp. 325 - 331

Given a set P of points in general position in the plane, the graph of triangulations of P has a vertex for every triangulation of P, and two of them are...

Triangulation | Mathematics | Engineering Design | Combinatorics | Perfect matching | Non-crossing | MATHEMATICS | triangulation | non-crossing | perfect matching | Graphs

Triangulation | Mathematics | Engineering Design | Combinatorics | Perfect matching | Non-crossing | MATHEMATICS | triangulation | non-crossing | perfect matching | Graphs

Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2000, Volume 1763, pp. 274 - 277

If G is a geometric graph with n greater than or equal to 5 vertices and for any set U with 5 vertices of G, the geometric subgraph of G, induced by U, has a...

COMPUTER SCIENCE, THEORY & METHODS

COMPUTER SCIENCE, THEORY & METHODS

Conference Proceeding

Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 16, pp. 3441 - 3448

The neighbourhood heterochromatic number nh c ( G ) of a non-empty graph G is the smallest integer l such that for every colouring of G with exactly l colours,...

Heterochromatic | Neighbourhood | Hypercube | MATHEMATICS | hypercube | heterochromatic | ANTI-RAMSEY THEOREM | neighbourhood

Heterochromatic | Neighbourhood | Hypercube | MATHEMATICS | hypercube | heterochromatic | ANTI-RAMSEY THEOREM | neighbourhood

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 2006, Volume 34, Issue 2, pp. 116 - 125

Consider the following question: does every complete geometric graph K 2 n have a partition of its edge set into n plane spanning trees? We approach this...

Complete graph | Book embedding | Geometric graph | Plane tree | Book thickness | Convex graph | Crossing family | plane tree | MATHEMATICS | convex graph | MATHEMATICS, APPLIED | crossing family | geometric graph | book thickness | complete graph | book embedding | Computer science

Complete graph | Book embedding | Geometric graph | Plane tree | Book thickness | Convex graph | Crossing family | plane tree | MATHEMATICS | convex graph | MATHEMATICS, APPLIED | crossing family | geometric graph | book thickness | complete graph | book embedding | Computer science

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 2008, Volume 39, Issue 2, pp. 65 - 77

Given two n-vertex plane graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) with | E 1 | = | E 2 | embedded in the n × n grid, with straight-line segments as...

Graph drawing | Local transformation | Flip | Graph transformation | Grid drawing | Planar embedding | MATHEMATICS | MATHEMATICS, APPLIED | graph transformation | grid drawing | CLOSED SURFACES | local transformation | planar embedding | graph drawing | TRIANGULATIONS | DIAGONAL FLIPS | flip

Graph drawing | Local transformation | Flip | Graph transformation | Grid drawing | Planar embedding | MATHEMATICS | MATHEMATICS, APPLIED | graph transformation | grid drawing | CLOSED SURFACES | local transformation | planar embedding | graph drawing | TRIANGULATIONS | DIAGONAL FLIPS | flip

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2012, Volume 160, Issue 10-11, pp. 1524 - 1531

The acyclic disconnection of a digraph D is the maximum number of components that can be obtained by deleting from D the set of arcs of an acyclic subdigraph....

Multipartite tournaments | Regular bipartite tournaments | Acyclic disconnection | DIGRAPH | MATHEMATICS, APPLIED | Mathematical analysis | Graph theory | Disengaging

Multipartite tournaments | Regular bipartite tournaments | Acyclic disconnection | DIGRAPH | MATHEMATICS, APPLIED | Mathematical analysis | Graph theory | Disengaging

Journal Article

Lecture Notes in Computer Science, ISSN 0302-9743, 2004, Volume 3383, pp. 71 - 81

Consider the following open problem: does every complete geometric graph K-2n have a partition of its edge set into n plane spanning trees? We approach this...

COMPUTER SCIENCE, THEORY & METHODS

COMPUTER SCIENCE, THEORY & METHODS

Conference Proceeding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2004, Volume 3045, pp. 22 - 31

Given two n-vertex plane graphs G(1) and G(2) embedded in the n x n grid with straight-line segments as edges, we show that with a sequence of O(n) point moves...

TRIANGULATIONS | COMPUTER SCIENCE, THEORY & METHODS

TRIANGULATIONS | COMPUTER SCIENCE, THEORY & METHODS

Conference Proceeding

Discrete Mathematics, ISSN 0012-365X, 2003, Volume 271, Issue 1, pp. 303 - 310

For a set C of cycles of a connected graph G we define T( G, C) as the graph with one vertex for each spanning tree of G, in which two trees R and S are...

[formula omitted]-dense | Cycle space | Tree graph | Δ-dense | MATHEMATICS | SPANNING-TREES | cycle space | tree graph | Delta-dense

[formula omitted]-dense | Cycle space | Tree graph | Δ-dense | MATHEMATICS | SPANNING-TREES | cycle space | tree graph | Delta-dense

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 06/2004, Volume 20, Issue 2, pp. 223 - 231

For any set P of n points in general position in the plane there is a convex decomposition of P with at most elements. Moreover, any minimal convex...

Minimal convex decomposition | Mathematics | MATHEMATICS | minimal convex decomposition | Graph representations | Graphs | Graph theory

Minimal convex decomposition | Mathematics | MATHEMATICS | minimal convex decomposition | Graph representations | Graphs | Graph theory

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 2001, Volume 18, Issue 2, pp. 65 - 72

Let P be a set of n points in convex position in the plane. The path graph G(P) of P is the graph with one vertex for each plane spanning path of P, in which...

Geometric graph | Spanning path | MATHEMATICS | MATHEMATICS, APPLIED | geometric graph | spanning path

Geometric graph | Spanning path | MATHEMATICS | MATHEMATICS, APPLIED | geometric graph | spanning path

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 1998, Volume 10, Issue 2, pp. 121 - 124

Any family of k 3 + 1 pairwise disjoint line segments in the Euclidean plane E 2, such that no three of their endpoints are collinear, has k + 1 members...

MATHEMATICS | MATHEMATICS, APPLIED

MATHEMATICS | MATHEMATICS, APPLIED

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.