On 4-edge coloring of cubic graphs containing ``small non-planar subgraphs

DOI10.17654/DM018030317MaRDI QIDQ4639461zbMATH OpenOpenAlexFDO

Authors Diamantis 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)

Recommendations

• New bound for the number of times color 4 is required, in terms of the distance between the crossing points, in the drawing of a cubic graph
• Inequalities for the times we have to use the fourth color in a 4-edge coloring of a cubic graph
• The distance between crossing points as a parameter in edge coloring problems for cubic graphs
• Color-character of uncolorable cubic graphs
• scientific article; zbMATH DE number 3916298

Cites work

• scientific article; zbMATH DE number 3221976 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• 3-coloring in time
• A simple and fast heuristic algorithm for edge-coloring of graphs
• Approximating the maximum 2- and 3-edge-colorable subgraph problems
• Approximating the maximum 3-edge-colorable subgraph problem
• Approximation algorithms for NP-hard problems.
• Crossing Number is NP-Complete
• Improved edge-coloring with three colors
• The NP-Completeness of Edge-Coloring
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• The distance between crossing points as a parameter in edge coloring problems for cubic graphs

Cited in

(6)

• Color-character of uncolorable cubic graphs
• New bound for the number of times color 4 is required, in terms of the distance between the crossing points, in the drawing of a cubic graph
• Some bound of the edge chromatic surplus of certain cubic graphs
• The distance between crossing points as a parameter in edge coloring problems for cubic graphs
• Inequalities for the times we have to use the fourth color in a 4-edge coloring of a cubic graph
• The color number of cubic graphs having a spanning tree with a bounded number of leaves

This page was built for publication: On 4-edge coloring of cubic graphs containing ``small non-planar subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639461)