(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs

DOI10.1017/S0963548300001000MaRDI QIDQ4306435zbMATH OpenWikidataFDO

Authors Anders Johansson, Roland Häggkvist

Publication date 24 October 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300001000

zbMATH Keywords

decomposition2-factorEulerian graph2-factorizationedge-colouring

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Almost‐regular factorization of graphs
• Factorizations of regular graphs of high degree
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• Decomposition of graphs with constraint on minimum degree
• scientific article; zbMATH DE number 3922695

Cites work

• The embedding of partial triple systems when 4 divides \(\lambda\)

Cited in

(3)

• Almost‐regular factorization of graphs
• (r,r+1)-factorizations of (d,d+1)-graphs
• scientific article; zbMATH DE number 2061806 (Why is no real title available?)

This page was built for publication: (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs

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