DOIAbstract
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar grap...
A conjecture of Alspach and Rosenfeld states that the prism G2K 2 over any 3-connected cubic graph ...
Let Γk,g be the class of k-connected cubic graphs of girth at least g. For several choices of k and ...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every ...
AbstractWe solve a conjecture of Foulds and Robinson (1979) on decomposable triangulations in the pl...
Let S = K1,3,K3, P4 be the set of connected graphs of size 3. We study the problem of partitioning t...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
AbstractWe solve a conjecture of Foulds and Robinson (1979) on decomposable triangulations in the pl...
10, pages, 6 figures, 1 tableInternational audienceWe discuss conjectures on Hamiltonicity in cubic ...
10, pages, 6 figures, 1 tableInternational audienceWe discuss conjectures on Hamiltonicity in cubic ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
Graph designs are natural extensions of BIBDs (balanced incomplete block designs). In this paper we ...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar grap...
A conjecture of Alspach and Rosenfeld states that the prism G2K 2 over any 3-connected cubic graph ...
Let Γk,g be the class of k-connected cubic graphs of girth at least g. For several choices of k and ...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every ...
AbstractWe solve a conjecture of Foulds and Robinson (1979) on decomposable triangulations in the pl...
Let S = K1,3,K3, P4 be the set of connected graphs of size 3. We study the problem of partitioning t...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
AbstractWe solve a conjecture of Foulds and Robinson (1979) on decomposable triangulations in the pl...
10, pages, 6 figures, 1 tableInternational audienceWe discuss conjectures on Hamiltonicity in cubic ...
10, pages, 6 figures, 1 tableInternational audienceWe discuss conjectures on Hamiltonicity in cubic ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
Graph designs are natural extensions of BIBDs (balanced incomplete block designs). In this paper we ...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar grap...
A conjecture of Alspach and Rosenfeld states that the prism G2K 2 over any 3-connected cubic graph ...
Let Γk,g be the class of k-connected cubic graphs of girth at least g. For several choices of k and ...
Add to ORKG