The equivalence number of a line graph
From MaRDI portal
Publication:350825
zbMath1268.05171MaRDI QIDQ350825
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
05A05: Permutations, words, matrices
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
05C76: Graph operations (line graphs, products, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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