AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For any three distinct vertices x, y, z there is a path from x to z through y and having length at least2d − 2. In this paper, we characterize those graphs for which no such path has length exceeding 2d − 2
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractLet G(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifo...
AbstractLet p2(G) denote the number of paths of length 2 in the graph G, and let g(v, e) = max{p2(G)...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
A graph is k-linked if for every set of 2k distinct vertices {s(1),...,s(k), t(1),...,t(k)} there ex...
In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path...
A graph is k-linked if for every set of 2k distinct vertices {s1,..., sk, t1,..., tk} there exist di...
A graph is k-linked if for every set of 2k distinct vertices fs1; : : : ; sk; t1; : : : ; tkg there ...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractS.C. Locke proposed a question: If G is a 3-connected graph with minimum degree d and X is a...
Let Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [On 3-Hypergraphs with Forbidde...
summary:In this paper it is proved that every $3$-connected planar graph contains a path on $3$ vert...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractLet G(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifo...
AbstractLet p2(G) denote the number of paths of length 2 in the graph G, and let g(v, e) = max{p2(G)...
AbstractLet G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For an...
A graph is k-linked if for every set of 2k distinct vertices {s(1),...,s(k), t(1),...,t(k)} there ex...
In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path...
A graph is k-linked if for every set of 2k distinct vertices {s1,..., sk, t1,..., tk} there exist di...
A graph is k-linked if for every set of 2k distinct vertices fs1; : : : ; sk; t1; : : : ; tkg there ...
AbstractDirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected gra...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractS.C. Locke proposed a question: If G is a 3-connected graph with minimum degree d and X is a...
Let Gi be the (unique) 3-graph with 4 vertices and i edges. Razborov [On 3-Hypergraphs with Forbidde...
summary:In this paper it is proved that every $3$-connected planar graph contains a path on $3$ vert...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractLet G(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifo...
AbstractLet p2(G) denote the number of paths of length 2 in the graph G, and let g(v, e) = max{p2(G)...
DOI
Add to ORKG