Rotationally symmetric snarks from voltage graphs
- 25 January 2024
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
Abstract
No abstract availableKeywords
Funding Information
- Secretaría de Ciencia, Humanidades, Tecnología e Innovación (166306)
- National Autonomous University of Mexico
- Universidad Nacional Autónoma de México Dirección General de Asuntos del Personal Académico (PAPIIT 104915)
- Simons Foundation (209161)
This publication has 11 references indexed in Scilit:
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect MatchingsJournal of Graph Theory, 2013
- House of Graphs: A database of interesting graphsDiscrete Applied Mathematics, 2013
- Configurations from a Graphical Viewpoint2013
- Infinite Classes of Dihedral SnarksMediterranean Journal of Mathematics, 2008
- On the strong circular 5‐flow conjectureJournal of Graph Theory, 2006
- Irreducible snarks of given order and cyclic connectivityDiscrete Mathematics, 2006
- Polycyclic configurationsEuropean Journal of Combinatorics, 2003
- Smallest maximally nonhamiltonian graphsPeriodica Mathematica Hungarica, 1983
- Construction of class 2 graphs with maximum vertex degree 3Journal of Combinatorial Theory, Series B, 1981
- Network-ColouringsThe Mathematical Gazette, 1948