Mixed graph edge coloring

DOI10.1016/j.disc.2008.11.033zbMath1250.05047OpenAlexW2018626742MaRDI QIDQ1043571

Adrian Kosowski, Hanna Furmańczyk, Paweł Żyliński, Bernard Ries

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/324620/files/mixededgecoloring.pdf

zbMATH Keywords

complexityedge coloringbipartite graphstreesmixed graphsprecoloring extensionnetwork communication

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On weak chromatic polynomials of mixed graphs, Three new upper bounds on the chromatic number

Cites Work

• Coloring some classes of mixed graphs
• Using mixed graph coloring to minimize total completion time in job shop scheduling
• A note on mixed tree coloring
• Mixed graph colorings
• On two coloring problems in mixed graphs
• Scheduling Problems and Mixed Graph Colorings
• Edge-Coloring Partialk-Trees
• The NP-Completeness of Edge-Coloring
• NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item