Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult, Algorithmica, vol.44, issue.4 ,
DOI : 10.1007/s00453-005-1176-8
Cycle decompositions, 2-coverings, removable cycles, and the four-color-disease, Progress in Graph Theory, pp.233-246, 1984. ,
A common basis for the theory of Eulerian graphs and the theorem of Petersen, Monatshefte f???r Mathematik, vol.42, issue.4, pp.267-278, 1976. ,
DOI : 10.1007/BF01387754
A Note Concerning some Conjectures on Cyclically 4???Edge Connected 3???Regular Graphs, Graph Theory in Memory of G. A. Dirac, pp.171-178, 1989. ,
DOI : 10.1016/S0167-5060(08)70458-8
Planar graph colorings without short monochromatic cycles, Journal of Graph Theory, vol.144, issue.1, pp.25-38, 2004. ,
DOI : 10.1002/jgt.10167
Hamiltonian results inK1,3-free graphs, Journal of Graph Theory, vol.82, issue.1, pp.139-146, 1984. ,
DOI : 10.1002/jgt.3190080116
Ein Beweis des Petersenschen Graphensatzes, Acta Litt. Sci. Szeged, vol.7, pp.51-57, 1934. ,
Decomposing a Planar Graph into Degenerate Graphs, Journal of Combinatorial Theory, Series B, vol.65, issue.2, pp.305-314, 1995. ,
DOI : 10.1006/jctb.1995.1057
Reflections on graph theory, Journal of Graph Theory, vol.57, issue.3, pp.309-324, 1986. ,
DOI : 10.1002/jgt.3190100308
A theorem on planar graphs, Transactions of the American Mathematical Society, vol.82, issue.1, pp.99-116, 1956. ,
DOI : 10.1090/S0002-9947-1956-0081471-8
On the algebraic theory of graph colorings, Journal of Combinatorial Theory, vol.1, issue.1, pp.15-50, 1966. ,
DOI : 10.1016/S0021-9800(66)80004-2
Integer Flows and Cycle Covers of Graphs, 1997. ,