Short solution of Kotzig's problem for bipartite graphs

DOI10.1006/JCTB.1998.1838zbMath1023.05055OpenAlexW2003656643MaRDI QIDQ1569037

Armen S. Asratian

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1838

zbMATH Keywords

colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Pseudo 2-factor isomorphic regular bipartite graphs ⋮ A note on transformations of edge colorings of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformations of edge-colourings of cubic graphs
• Restricted Edge-colourings of Bipartite Graphs
• The NP-Completeness of Edge-Coloring
• Some graph‐theoretical models for scheduling in automated production systems
• NP completeness of finding the chromatic index of regular graphs
• A Theorem on Coloring the Lines of a Network
• 25 pretty graph colouring problems

This page was built for publication: Short solution of Kotzig's problem for bipartite graphs