Hajós' conjecture and projective graphs

DOI10.1016/S0012-365X(01)00290-4MaRDI QIDQ1613489zbMATH OpenWikidataFDO

Authors Genghua Fan, Baogang Xu

Publication date 29 August 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00290-4

zbMATH Keywords

decompositionEulerian graphprojective graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hajós' conjecture and connectivity of Eulerian graphs
• Cycle decompositions of pathwidth-6 graphs
• scientific article; zbMATH DE number 4061286
• Some remarks on Hajós' conjecture
• Triangulations and the Hajós conjecture

Cited in

(11)

• Hajós' conjecture and connectivity of Eulerian graphs
• On the Hajós number of graphs
• Long cycles, heavy cycles and cycle decompositions in digraphs
• Projective dimension of hypergraphs
• Decomposing toroidal graphs into circuits and edges
• Path and cycle decompositions of dense graphs
• The graph constructions ofHaj�s and Ore
• Cycle decompositions of pathwidth-6 graphs
• A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
• Triangulations and the Hajós conjecture
• Small oriented cycle double cover of graphs

This page was built for publication: Hajós' conjecture and projective graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613489)