On a conjecture concerning the Petersen graph. II
The electronic journal of combinatorics, Tome 21 (2014) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Robertson conjectured that the only 3-connected, internally 4-connected graph of girth 5 in which every odd cycle of length greater than 5 has a chord is the Petersen graph. We provide a counterexample to this conjecture.
DOI : 10.37236/2315
Classification : 05C38, 05C40
Mots-clés : graph theory, cycles, connectivity, Petersen graph

Michael Plummer  1   ; Xiaoya Zha  2

1 Vanderbilt University (emeritus)
2 Middle Tennessee State University
@article{10_37236_2315,
     author = {Michael Plummer and Xiaoya Zha},
     title = {On a conjecture concerning the {Petersen} graph. {II}},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {1},
     doi = {10.37236/2315},
     zbl = {1300.05149},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2315/}
}
TY  - JOUR
AU  - Michael Plummer
AU  - Xiaoya Zha
TI  - On a conjecture concerning the Petersen graph. II
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2315/
DO  - 10.37236/2315
ID  - 10_37236_2315
ER  - 
%0 Journal Article
%A Michael Plummer
%A Xiaoya Zha
%T On a conjecture concerning the Petersen graph. II
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2315/
%R 10.37236/2315
%F 10_37236_2315
Michael Plummer; Xiaoya Zha. On a conjecture concerning the Petersen graph. II. The electronic journal of combinatorics, Tome 21 (2014) no. 1. doi: 10.37236/2315

Cité par Sources :