A Construction of Chromatic Index Critical Graphs of Maximum Degree 3
Shi Wen-jun
Abstract
Shi Wen-jun
Abstract
The chromatic index χ′(G) of a graph G was the minimum number of colors required to color the edges of G so that different colors were received for two adjacent edges.Five quadrangle extension types of graphs of maximum degree 3 were given and the stable criticality of them was proved.Furthermore,it could be used to construct new critical graphs in higher color levels.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The chromatic index χ′(G) of a graph G was the minimum number of colors required to color the edges of G so that different colors were received for two adjacent edges.Five quadrangle extension types of graphs of maximum degree 3 were given and the stable criticality of them was proved.Furthermore,it could be used to construct new critical graphs in higher color levels.
Key concepts: Edge coloring, Mathematics, Degree (music), Graph, Quadrangle, Chromatic scale, Extension (predicate logic), Brooks' theorem