Missouri Journal of Mathematical Sciences

The Equivalence Number of a Line Graph

Christopher McClain

Full-text: Open access

Abstract

The chromatic index of a graph $G$ is most often defined to be the minimum size of a partition of the edge set of $G$ into matchings. An equivalent but different definition is the minimum size of a cover of the edge set of $G$ by matchings. We consider the analogous problem of covering the edge set of $G$ by subgraphs that are vertex-disjoint unions of cliques, known as equivalence graphs. The minimum size of such a cover is the equivalence number of $G$. We compute the equivalence number of the line graph of a clique on at most 12 vertices. We also construct a particular type of cover to show that, for all graphs $G$ on at most n vertices, the equivalence number of the line graph of $G$ has an upper bound on the order of log n. Finally, we show that if $G$ is a clique on 13 vertices then the minimum size of this particular cover is 5.

Article information

Source
Missouri J. Math. Sci., Volume 25, Issue 1 (2013), 61-75.

Dates
First available in Project Euclid: 28 May 2013

Permanent link to this document
https://projecteuclid.org/euclid.mjms/1369746398

Digital Object Identifier
doi:10.35834/mjms/1369746398

Mathematical Reviews number (MathSciNet)
MR3087689

Zentralblatt MATH identifier
1268.05171

Subjects
Primary: 05A05: Permutations, words, matrices
Secondary: 05C15: Coloring of graphs and hypergraphs 05C70: Factorization, matching, partitioning, covering and packing

Keywords
equivalence number chromatic index clique

Citation

McClain, Christopher. The Equivalence Number of a Line Graph. Missouri J. Math. Sci. 25 (2013), no. 1, 61--75. doi:10.35834/mjms/1369746398. https://projecteuclid.org/euclid.mjms/1369746398


Export citation

References

  • M. O. Albertson, R. E. Jamison, S. T. Hedetniemi, and S. C. Locke, The subchromatic number of a graph, Discrete Math., 74 (1989), 33–49.
  • N. Alon, Covering graphs by the minimum number of equivalence relations, Combinatorica, 6.3 (1986), 201–206.
  • G. Chartrand and P. Zhang, Chromatic Graph Theory, Chapman & Hall, CRC Press, Boca Raton, FL, 2009.
  • R. D. Chatham, G. H. Fricke, J. Harless, R. D. Skaggs, and N. Wahle, Transit graphs, Preliminary Report (1033-05-15), AMS Fall Southeastern Sectional Meeting, Nov. 4, 2007.
  • M. Chudnovsky and P. Seymour, Claw-free graphs. IV. Decomposition theorem, J. Combin. Theory Ser. B, 98 (2008), 839–938.
  • R. Diestel, Graph Theory, 2nd ed., Springer-Verlag, New York, 2000.
  • P. Duchet, Représentations, noyaux en théorie des graphes et hypergraphes, Thése d'Etat, Université Paris VI, 1979.
  • L. Esperet, J. Gimbel, and A. King, Covering line graphs with equivalence relations, Discrete Applied Mathematics, 158 (2010), 1902–1907.
  • Z. Furedi, On the Prague dimension of Kneser graphs, Numbers, Information and Complexity (Bielefeld, 1998) pp. 125–128, Kluwer Academic Publishers, Boston, MA, 2000.
  • T. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons, New York, 1995.
  • L. Lovász, J. Nešetřil, and A. Pultr, On a product dimension of graphs, J. Combin. Theory Ser. B, 29.1 (1980), 47–67.
  • C. McClain, Edge colorings of graphs and multigraphs, doctoral dissertation, The Ohio State University, 2008.
  • C. McClain, The clique chromatic index of line graphs, unpublished manuscript, 2009.
  • J. Nešetřil and A. Pultr, A Dushnik–Miller type dimension of graphs and its complexity, in Fundamentals of Computation Theory, Proc. Conf. Poznań–Kórnik, 1977, Springer Lecture Notes in Comp. Sci., 56 (1977), 482–493.
  • D. B. West, Introduction to Graph Theory, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 2000.