AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of a solvable group is either 3-edge-colourable, or isomorphic to the Petersen graph
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular ed...
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle dou...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. Thi...
AbstractWe develop an idea of a local 3-edge-coloring of a cubic graph, a generalization of the usua...
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic gr...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
In this BSc thesis we deal with chromatic index of cubic graphs, where we mainly focus on a signific...
AbstractThis paper classifies all finite edge colored graphs with doubly transitive automorphism gro...
AbstractLet S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its e...
Soumis pour publication le 15 février 2019.The Petersen colouring conjecture states that every bridg...
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it ca...
A k-bisection of a bridgeless cubic graph G is a 2-colouring of its vertex set such that the colour ...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular ed...
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle dou...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. Thi...
AbstractWe develop an idea of a local 3-edge-coloring of a cubic graph, a generalization of the usua...
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic gr...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
In this BSc thesis we deal with chromatic index of cubic graphs, where we mainly focus on a signific...
AbstractThis paper classifies all finite edge colored graphs with doubly transitive automorphism gro...
AbstractLet S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its e...
Soumis pour publication le 15 février 2019.The Petersen colouring conjecture states that every bridg...
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it ca...
A k-bisection of a bridgeless cubic graph G is a 2-colouring of its vertex set such that the colour ...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular ed...
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle dou...
DOI
Add to ORKG