Extending an edge-coloring

DOI10.1002/JGT.3190140508zbMATH Open0705.05031OpenAlexW2103223314MaRDI QIDQ3484858FDOQ3484858

Authors:

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

Recommendations

• Edge precoloring extension of trees
• Restricted extension of sparse partial edge colorings of hypercubes
• scientific article; zbMATH DE number 3875311
• Restricted extension of sparse partial edge colorings of complete graphs
• Extension from precoloured sets of edges

zbMATH Keywords

proper edge colouringextendible partial colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (19)

• Precoloring extension. I: Interval graphs
• Extension from precoloured sets of edges
• List-edge-colouring planar graphs with precoloured edges
• Edge list multicoloring trees: An extension of Hall's theorem
• Avoiding and extending partial edge colorings of hypercubes
• Restricted extension of sparse partial edge colorings of hypercubes
• Embedding connected factorizations
• Extending partial edge colorings of iterated Cartesian products of cycles and paths
• Title not available (Why is that?)
• Extension of colorings
• The combinatorics of timetabling
• Title not available (Why is that?)
• On a type of assigning a colour from given sets to the edges of a graph
• List edge multicoloring in graphs with few cycles
• Toward a three-dimensional counterpart of Cruse's theorem
• Complexity results for minimum sum edge coloring
• Graph edge coloring: a survey
• Precoloring Extension III: Classes of Perfect Graphs
• Edge precoloring extension of trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484858)