Rotationally symmetric snarks from voltage graphs

DOI10.1016/j.disc.2024.113874OpenAlexW4391242824MaRDI QIDQ6197742

Leah Wrenn Berman, Deborah Oliveros, Gordon Ian Williams

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113874

zbMATH Keywords

symmetrygraph coloringsnarks

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On snarks that are far from being 3-edge colorable
• Generation and properties of snarks
• Infinite classes of dihedral snarks
• Construction of class two graphs with maximum vertex degree three
• Smallest maximally nonhamiltonian graphs
• House of Graphs: a database of interesting graphs
• Polycyclic configurations
• Small snarks with large oddness
• Factorisation of snarks
• Irreducible snarks of given order and cyclic connectivity
• Configurations from a Graphical Viewpoint
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On the strong circular 5‐flow conjecture
• Network-Colourings

This page was built for publication: Rotationally symmetric snarks from voltage graphs