From edge-coloring to strong edge-coloring

zbMath1310.05085MaRDI QIDQ2341055

Nathann Cohen, Petru Valicov, Shinya Fujita, Valentin Borozan, Reza Naserasr, Gerard Jennhwa Chang, Narayanan Narayanan

Publication date: 22 April 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p9

zbMATH Keywords

NP-completenessextremal combinatoricscomplete bipartite graphsedge coloringsmaximum degree bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Some simplified NP-complete graph problems
• On the computational complexity of strong edge coloring
• Factorisation of snarks
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Extremal Combinatorics
• On k-intersection edge colourings
• The NP-Completeness of Edge-Coloring
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: From edge-coloring to strong edge-coloring