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

DOI10.1017/S0963548300001000zbMath0812.05048WikidataQ114116563 ScholiaQ114116563MaRDI QIDQ4306435

Anders Johansson, Roland Haeggkvist

Publication date: 24 October 1994

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

zbMATH Keywords

decomposition2-factoredge-colouringEulerian graph2-factorization

Mathematics Subject Classification ID

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

Related Items (1)

\((r,r+1)\)-factorizations of \((d,d+1)\)-graphs

Cites Work

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

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