Extending an edge-coloring

DOI10.1002/jgt.3190140508zbMath0705.05031OpenAlexW2103223314MaRDI QIDQ3484858

No author found.

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140508

zbMATH Keywords

proper edge colouringextendible partial colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Avoiding and extending partial edge colorings of hypercubes ⋮ List-edge-colouring planar graphs with precoloured edges ⋮ Embedding connected factorizations ⋮ Edge list multicoloring trees: An extension of Hall's theorem ⋮ Extension from precoloured sets of edges ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Precoloring Extension III: Classes of Perfect Graphs ⋮ Unnamed Item ⋮ Graph edge coloring: a survey ⋮ Precoloring extension. I: Interval graphs ⋮ Complexity results for minimum sum edge coloring ⋮ List edge multicoloring in graphs with few cycles ⋮ The combinatorics of timetabling

Cites Work

• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Extending an edge-coloring