ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS

DOI10.17654/DM018030317zbMath1401.05120OpenAlexW2737753190MaRDI QIDQ4639461

Diamantis P. Koreas

Publication date: 9 May 2018

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm018030317

zbMATH Keywords

edge coloringmax-3-edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved edge-coloring with three colors
• Approximating the maximum 2- and 3-edge-colorable subgraph problems
• Approximating the maximum 3-edge-colorable subgraph problem
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• A simple and fast heuristic algorithm for edge-coloring of graphs
• Crossing Number is NP-Complete
• The NP-Completeness of Edge-Coloring
• 3-coloring in time

This page was built for publication: ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS