The equivalence number of a line graph

zbMath1268.05171MaRDI QIDQ350825

Christopher McClain

Publication date: 3 July 2013

Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.mjms/1369746398

zbMATH Keywords

cliquechromatic indexequivalence number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Covering line graphs with equivalence relations
• Claw-free graphs. IV: Decomposition theorem
• Covering graphs by the minimum number of equivalence relations
• On a product dimension of graphs
• The subchromatic number of a graph
• Hidden superconformal symmetry in M-theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The equivalence number of a line graph