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

DOI10.46298/DMTCS.11377zbMATH Open1547.05085MaRDI QIDQ6606987FDOQ6606987

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

Publication date: 17 September 2024

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

zbMATH Keywords

list coloringCartesian productedge coloringprecoloring extension

Mathematics Subject Classification ID

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

Cites Work

• Thank Evans!
• Embedding Incomplete Latin Squares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Combinatorial Theorem with an Application to Latin Rectangles
• Extension from precoloured sets of edges
• On completing latin squares
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Extending an edge-coloring
• A precolouring extension of Vizing's theorem
• Edge precoloring extension of hypercubes
• Symmetric latin square and complete graph analogues of the evans conjecture
• Title not available (Why is that?)

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)