Hamilton weights and Petersen minors

@article{Lai2001HamiltonWA,
  title={Hamilton weights and Petersen minors},
  author={Hong-Jian Lai and Cun-Quan Zhang},
  journal={Journal of Graph Theory},
  year={2001},
  volume={38},
  pages={197-219}
}
A (1, 2)-eulerian weight w of a cubic graph is called a Hamilton weight if every faithful circuit cover of the graph with respect to w is a set of two Hamilton circuits. Let G be a 3-connected cubic graph containing no Petersen minor. It is proved in this paper that G admits a Hamilton weight if and only if G can be obtained from K4 by a series of4$Y-operations. As a byproduct of the proof of the main theorem, we also prove that if G is a permutation graph and w is a (1,2)-eulerian weight of G… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
4 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Sums of circuits, Graph Theory and Related Topics

  • P. D. Seymour
  • 1979
Highly Influential
5 Excerpts

Integer Flows and Cycle Covers of Graphs, Marcel

  • C. -Q. Zhang
  • Dekker Inc. NY,
  • 1997
2 Excerpts

The 4-color theorem

  • N. Robertson, D. Sanders, P. D. Seymour, R. Thomas
  • J Combin Theory Ser B
  • 1997
1 Excerpt

On minimal counterexamples to a conjecture about unique edge-3-coloring

  • J. L. Goldwasser, C. Q. Zhang
  • Congr Numer
  • 1996
1 Excerpt

Uniquely linecolorable graphs

  • H. V. Kronk
  • Canad Math Bull
  • 1996

On circuit covers, circuit decompositions and Euler tours of graphs, Surveys in Combinatorics, Keele (Editor)

  • B. Jackson
  • London Math Soc Lecture Note Ser
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…