How to find overfull subgraphs in graphs with large maximum degree. II.
Niessen, Thomas
The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121258 
@article{01560492,
     title = {How to find overfull subgraphs in graphs with large maximum degree. II.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {8},
     year = {2001},
     zbl = {0970.05023},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01560492}
}

Niessen, Thomas. How to find overfull subgraphs in graphs with large maximum degree. II.. The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001) . http://gdmltest.u-ga.fr/item/01560492/