Geodesic
Colouring the petals of a graph
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A petal graph is a connected graph $G$ with maximum degree three, minimum degree two, and such that the set of vertices of degree three induces a $2$–regular graph and the set of vertices of degree two induces an empty graph. We prove here that, with the single exception of the graph obtained from the Petersen graph by deleting one vertex, all petal graphs are Class $1$. This settles a particular case of a conjecture of Hilton and Zhao.
DOI : 10.37236/1699
Classification : 05C15 
@article{10_37236_1699,
     author = {David Cariolaro and Gianfranco Cariolaro},
     title = {Colouring the petals of a graph},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1699},
     zbl = {1011.05022},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1699/}
}
TY  - JOUR
AU  - David Cariolaro
AU  - Gianfranco Cariolaro
TI  - Colouring the petals of a graph
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1699/
DO  - 10.37236/1699
ID  - 10_37236_1699
ER  - 
%0 Journal Article
%A David Cariolaro
%A Gianfranco Cariolaro
%T Colouring the petals of a graph
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1699/
%R 10.37236/1699
%F 10_37236_1699
David Cariolaro; Gianfranco Cariolaro. Colouring the petals of a graph. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1699

Cité par Sources :