Avoiding and extending partial edge colorings of hypercubes

DOI10.1007/s00373-022-02485-zzbMath1486.05084arXiv2104.00716OpenAlexW3146794249MaRDI QIDQ2122768

Carl Johan Casselgren, Klas Markström, Per-Olov Johansson

Publication date: 7 April 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeedge coloringprecoloring extensionavoiding edge coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Brooks' theorem with forbidden colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial Latin squares are avoidable
• On avoiding some families of arrays
• The complexity of completing partial Latin squares
• A survey of the theory of hypercube graphs
• A note on Latin squares with restricted support
• Avoiding partial Latin squares and intricacy
• Extension from precoloured sets of edges
• The list chromatic index of a bipartite multigraph
• Restricted extension of sparse partial edge colorings of hypercubes
• Restricted extension of sparse partial edge colorings of complete graphs
• Thank Evans!
• Embedding Incomplete Latin Squares
• Extending an edge-coloring
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Avoiding Arrays of Odd Order by Latin Squares
• Edge precoloring extension of hypercubes
• Restricted completion of sparse partial Latin squares
• $B$-valuations of graphs

This page was built for publication: Avoiding and extending partial edge colorings of hypercubes