Restricted extension of sparse partial edge colorings of complete graphs

DOI10.37236/9552zbMath1461.05084arXiv1912.07393OpenAlexW3154643730MaRDI QIDQ2662349

Carl Johan Casselgren, Lan Anh Pham

Publication date: 12 April 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.07393

zbMATH Keywords

edge precoloring extension problemssparse precoloring

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Avoiding and extending partial edge colorings of hypercubes ⋮ Brooks' theorem with forbidden colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Latin squares with restricted support
• The list chromatic index of a bipartite multigraph
• On restricted colorings of (d, s)-edge colorable graphs
• Clique decompositions of multipartite graphs and completion of Latin squares
• Completions of ε-Dense Partial Latin Squares
• Thank Evans!
• Embedding Incomplete Latin Squares
• Some upper bounds on the total and list chromatic numbers of multigraphs
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Symmetric latin square and complete graph analogues of the evans conjecture
• Avoiding Arrays of Odd Order by Latin Squares
• Edge precoloring extension of hypercubes
• Restricted completion of sparse partial Latin squares

This page was built for publication: Restricted extension of sparse partial edge colorings of complete graphs