On decompositions of a multi-graph into spanning subgraphs

DOI10.1090/S0002-9904-1974-13468-3zbMath0291.05113MaRDI QIDQ4041610

Ram Prakash Gupta

Publication date: 1974

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (19)

Polychromatic colorings of hypergraphs with high balance ⋮ Edge covering coloring of nearly bipartite graphs ⋮ Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers ⋮ Extension from precoloured sets of edges ⋮ On $g_c$-colorings of nearly bipartite graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Disconnected \(g_c\)-critical graphs ⋮ On edge covering colorings of graphs ⋮ The method of coloring in graphs and its application ⋮ Some properties on \(f\)-edge covered critical graphs ⋮ A special \(f\)-edge cover-coloring of multigraphs ⋮ Fractional \(f\)-edge cover chromatic index of graphs ⋮ ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS ⋮ Edge covered critical multigraphs ⋮ A note on the edge cover chromatic index of multigraphs ⋮ An edge-coloration theorem for bipartite graphs with applications ⋮ Lower bounds on the cover-index of a graph ⋮ A note on polychromatic colorings of plane graphs ⋮ A sufficient condition for equitable edge-colourings of simple graphs

Cites Work

• Balanced matrices

This page was built for publication: On decompositions of a multi-graph into spanning subgraphs