Investigations on an edge coloring problem

DOI10.1016/0012-365X(71)90022-7zbMath0218.05058MaRDI QIDQ2546513

Dominique de Werra

Publication date: 1971

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Edge-colouring of joins of regular graphs. I ⋮ A preemptive open shop scheduling problem with one resource ⋮ A generalization of interval edge-colorings of graphs ⋮ Critical graphs for chromatic difference sequences ⋮ Edge-colouring of joins of regular graphs. II ⋮ Wide partitions, Latin tableaux, and Rota's basis conjecture ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource ⋮ Edge-colouring of regular graphs of large degree ⋮ Multigraphs with quasiweak odd cycles ⋮ The chromatic index of graphs with large maximum degree ⋮ A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs ⋮ Majorization, packing, covering and matroids ⋮ Some sequences associated with combinatorial structures

Cites Work

• Some graphical properties of matrices with non-negative entries
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
• Unnamed Item

This page was built for publication: Investigations on an edge coloring problem