Indecomposable r-graphs and some other counterexamples

Journal of Graph Theory

Volumn 32, Issue 1, 1999, Pages 1-15

  Rizzi, Romeo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Fulkerson coloring; Indecomposable; Petersen graph; r graph

Indexed keywords

EID: 0033419780     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199909)32:1<1::AID-JGT1>3.0.CO;2-B     Document Type: Article

References (14)

1. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, J Res Nat Bur Stand B, Math & Math Phys 69B (1965), 125-130.
2. M. A. Fiol, "Boolean algebra approach to the construction of snarks," Graph theory, combinatorics, and applications, Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Shwenk, (Editors), Wiley, New York, 1991, pp 493-524.
3. M. A. Isaacs, "Infinite families of snarks," Graph theory, combinatorics, and applications, Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Shwenk, (Editors), Wiley, New York, 1991, pp. 493-524.
4. M. Kochol, A cyclically 6-edge-connected snark of order 118, Discrete Math 161 (1996), 297-300.
5. M. Kochol, Snarks without small cycles, J Comb Theory Ser B 67 (1996) 34-47.
6. L. Lovász, Matching structure and the matching lattice, J Combin Theory Ser B 43 (1987), 187-222.
7. G. H. J. Meredith, Regular n-valent n-connected non-Hamiltonian non-n-edge-colorable graphs, J Combin Theory Ser B 14 (1973), 55-60.
8. R. Rizzi, On packing T-joins, 1997, to appear.
9. R. Rizzi T-couplings and T-connectors, 1997, to appear.
10. A. Caprara and R. Rizzi, Improving a family of approximation algorithms to edge color multigraphs, Inform Proc Lett 68 (1998), 11-15.
11. P. D. Seymour, "Some unsolved problems on one-factorizations of graphs," Graph theory and related topics, J. A. Bondy and U. S. R. Murty (Editors), Academic, New York, 1979, pp. 367-368.
12. P. D. Seymour, On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc London Math Soc 38, 1979, pp. 423-460.
13. P. D. Seymour, private communication.
14. Y. Shiloach, Edge-disjoint branchings in directed multigraphs, Inform Proc Lett 8 (1979), 24-27.