On the girth of voltage graph lifts
From MaRDI portal
Publication:2430973
DOI10.1016/j.ejc.2010.12.003zbMath1226.05201MaRDI QIDQ2430973
Publication date: 8 April 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.12.003
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Strong edge colorings of graphs and the covers of Kneser graphs, Using bi-coset graphs to construct small regular and biregular graphs, Which Haar graphs are Cayley graphs?, On the defect of vertex-transitive graphs of given degree and diameter
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limitations of the use of solvable groups in Cayley graph cage constructions
- Girth and residual finiteness
- The sextet construction for cubic graphs
- Cayley type graphs and cubic graphs of large girth
- Dynamic cage survey
- Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
- A recursive approach to low complexity codes
- A new 5‐arc‐transitive cubic graph