Méthode et théorème général de coloration des aretes d'un multigraphe
From MaRDI portal
Publication:1225626
zbMath0326.05103MaRDI QIDQ1225626
Publication date: 1977
Published in: Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)
Related Items (19)
On the chromatic index of cographs and join graphs ⋮ Class one graphs ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Edge-colouring graphs with bounded local degree sums ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Sufficient conditions for a graph to be edge-colorable with maximum degree colors ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ Properties, proved and conjectured, of Keller, Mycielski, and queen graphs ⋮ Obstructions for regular colorings ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree ⋮ Recent results on the total chromatic number ⋮ Decompositions for edge-coloring join graphs and cobipartite graphs ⋮ Lower bounds on the cover-index of a graph ⋮ The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small ⋮ The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 ⋮ Edge-coloring of multigraphs ⋮ Decompositions of graphs into trees, forests, and regular subgraphs ⋮ A sufficient condition for equitable edge-colourings of simple graphs
This page was built for publication: Méthode et théorème général de coloration des aretes d'un multigraphe
