Minimal edge colorings of class 2 graphs and double graphs
Keywords:
chromatic index, resistance, minimal edge coloring, multigraph, direct product, lexicographic product, strong tensor product, double graph, generalized double graphAbstract
A proper edge coloring of a class 2 graph G is minimal if it contains a color class of cardinality equal to the resistance r(G) of G, which is the minimum number of edges that have to be removed from G to obtain a graph which is Δ(G)-edge colorable, where Δ(G) is the maximum degree of G. In this paper using some properties of minimal edge colorings of a class 2 graph and the notion of reflective edge colorings of the direct product of two graphs, we are able to prove that the double graph of a class 2 graph is of class 1. This result, recently conjectured, is moreover extended to some generalized double graphs.Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
