Tight factorizations of girth-4-regular graphs

MaRDI QIDQ6201751zbMATH OpenFDO

Authors Italo J. Dejter

Publication date 25 March 2024

Full work available at URL https://arxiv.org/abs/2102.06956

zbMATH Keywords

chromatic indexgirth-regular graphs with girthHamiltonian decomposabilityregular degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Tight factorizations of girth-3-regular graphs
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• Factorizations of regular graphs of high degree
• scientific article; zbMATH DE number 4101256
• 1-factorizing regular graphs of high degree - an improved bound

Cited in

(1)

• Tight factorizations of girth-3-regular graphs

This page was built for publication: Tight factorizations of girth-4-regular graphs

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