Conjectures on uniquely 3-edge-colorable graphs

Authors

  • Naoki Matsumoto Seikei University

DOI:

https://doi.org/10.11575/cdm.v12i1.62581

Keywords:

Uniquely coloring, Edge coloring, Cubic

Abstract

A graph $G$ is {\it uniquely k-edge-colorable} if the chromatic index of $G$ is $k$ and every two $k$-edge-colorings of $G$ produce the same partition of $E(G)$ into $k$ independent subsets.
For any $k\ne 3$, a uniquely $k$-edge-colorable graph $G$ is completely characterized;
$G\cong K_2$ if $k=1$, $G$ is a path or an even cycle if $k=2$,
and $G$ is a star $K_{1,k}$ if $k\geq 4$.
On the other hand, there are infinitely many uniquely 3-edge-colorable graphs, and hence, there are many conjectures for the characterization of uniquely 3-edge-colorable graphs.
In this paper, we introduce a new conjecture which connects conjectures of uniquely 3-edge-colorable planar graphs with those of uniquely 3-edge-colorable non-planar graphs.

References

\bibitem{bel} S.-M. Belcastro and R. Haas,
Triangle-free uniquely 3-edge colorable cubic graphs,
arXiv:1508.06934.

\bibitem{Ent} R.C. Entringer,
Spanning cycles of nearly cubic graphs,
{\it J. Combin. Theory B} {\bf 29} (1980), 303--309.

\bibitem{Fi} S. Fiorini,
On the chromatic index of a graph. III. Uniquely edge-colourable graphs.
{\it Quart. J. Math. Oxford Ser.} {\bf 26} (1975), 129--140.

\bibitem{FW} S. Fiorini and R. J. Wilson, Edge colourings of graphs, Selected Topics in Graph Theory,
{\it Academic Press, New York} (1978), 103--126.

\bibitem{fowler} T. Fowler, Unique Coloring of Planar Graphs,
Ph.D. thesis, Georgia Institute of Technology Mathematics Department (1998).

\bibitem{GZ} J.L. Goldwasser and C.-Q. Zhang,
Uniquely Edge-3-Colorable Graphs and Snarks,
{\it Graphs and Combinatorics} {\bf 16} (2000), 257--267.

\bibitem{GK} D. Greenwell and H. V. Kronk, Uniquely line-colorable graphs,
{\it Canad. Math. Bull} {\bf 16} (1973), 525--529.

\bibitem{isa} R. Isaacs,
Infinite families of non-trivial trivalent graphs which are not Tait colorable,
{\it Am. Math. Mon.} {\bf 82} (1975), 221--239.

\bibitem{sey} P.D. Seymour, Sums of circuits,
In Graph Theory and Related Topics (Ed. J.A. Bondy and U.R.S. Murty).
New York: Academic Press (1979), 341--355.

\bibitem{tait} P.G. Tait,
Remarks on the coloring of maps,
{\it Proceeding of the Royal Society of Edinbrugh} {\bf 10} (1880), 501--503, 729.

\bibitem{U4} A. Thomason, Hamiltonian cycles and uniquely edge colourable graphs,
{\it Annals Disc. Math.} {\bf 3} (1978), 259--268.

\bibitem{Zh} C.-Q. Zhang, Hamiltonian weights and unique edge-3-colorings of cubic graphs,
{\it J. Graph Theory} {\bf 20} (1995), 91--99.

Downloads

Published

2017-09-27

Issue

Vol. 12 No. 1 (2017)

Section

Articles

License

 

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from  Volume 15 number 3.   When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM)  a world-wide, irrevocable, royalty free,  non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. 

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license.   Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM,  the work will appear with the CC-BY-ND logo.  Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND.  https://creativecommons.org/licenses/

Attribution-NoDerivs
CC BY-ND

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.