Extending partial edge colorings of iterated Cartesian products of cycles and paths

DOI10.46298/DMTCS.11377MaRDI QIDQ6606987zbMATH OpenFDO

Authors Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros

Publication date 17 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

list coloringCartesian productedge coloringprecoloring extension

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Edge precoloring extension of hypercubes
• Avoiding and extending partial edge colorings of hypercubes
• Restricted extension of sparse partial edge colorings of hypercubes
• Edge precoloring extension of trees

Cites work

• scientific article; zbMATH DE number 3663157 (Why is no real title available?)
• scientific article; zbMATH DE number 3737686 (Why is no real title available?)
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• A Combinatorial Theorem with an Application to Latin Rectangles
• A precolouring extension of Vizing's theorem
• Edge precoloring extension of hypercubes
• Edge precoloring extension of trees
• Embedding Incomplete Latin Squares
• Extending an edge-coloring
• Extension from precoloured sets of edges
• NP completeness of the edge precoloring extension problem on bipartite graphs
• On completing latin squares
• Symmetric latin square and complete graph analogues of the evans conjecture
• Thank Evans!

This page was built for publication: Extending partial edge colorings of iterated Cartesian products of cycles and paths

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