Algorithms for the Generation of Snarks
Fuente:
arXiv
Saved in:
| Main Authors: | Brinkmann, Gunnar, Van Overberghe, Steven |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Generating maps on oriented surfaces using the homomorphism principle
by: Brinkmann, Gunnar
Published: (2024)
by: Brinkmann, Gunnar
Published: (2024)
On the number of small edge-weighted subgraphs
by: Yu, Feng, et al.
Published: (2025)
by: Yu, Feng, et al.
Published: (2025)
On the largest chromatic number of $F$-free hypergraphs
by: Wang, Yichen, et al.
Published: (2026)
by: Wang, Yichen, et al.
Published: (2026)
Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)
Reflexive Digraph Reconfiguration by Orientation Strings
by: Pullas, David Emmanuel Pazmiño, et al.
Published: (2025)
by: Pullas, David Emmanuel Pazmiño, et al.
Published: (2025)
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Sharp Bounds on Lengths of Linear Recolouring Sequences
by: Cambie, Stijn, et al.
Published: (2024)
by: Cambie, Stijn, et al.
Published: (2024)
5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
by: Inoue, Yuta, et al.
Published: (2025)
by: Inoue, Yuta, et al.
Published: (2025)
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Coloring graphs as complete graph invariants
by: Asgarli, Shamil, et al.
Published: (2025)
by: Asgarli, Shamil, et al.
Published: (2025)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)
by: Lee, Jae-baek, et al.
Published: (2021)
On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)
by: Hoàng, Chính T.
Published: (2025)
Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
by: Goedgebeur, Jan, et al.
Published: (2023)
by: Goedgebeur, Jan, et al.
Published: (2023)
$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)
by: Balachandran, Niranjan, et al.
Published: (2021)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)
by: Zaker, Manouchehr
Published: (2021)
Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
by: Allagan, Julian, et al.
Published: (2026)
by: Allagan, Julian, et al.
Published: (2026)
Quota Trees
by: White, Tad
Published: (2024)
by: White, Tad
Published: (2024)
Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
by: Chu, Hojin, et al.
Published: (2025)
by: Chu, Hojin, et al.
Published: (2025)
On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
by: Halberg, Charlie, et al.
Published: (2020)
by: Halberg, Charlie, et al.
Published: (2020)
Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)
A dual view of Roman Domination: The 2-limited packing problem
by: Bachtler, Oliver, et al.
Published: (2026)
by: Bachtler, Oliver, et al.
Published: (2026)
Exploring the Influence of Graph Operations on Zero Forcing Sets
by: Menon, Krishna, et al.
Published: (2024)
by: Menon, Krishna, et al.
Published: (2024)
On the minimal forts of trees
by: Cameron, Thomas R., et al.
Published: (2025)
by: Cameron, Thomas R., et al.
Published: (2025)
Preserving and Increasing Symmetries of Polyhedral Maps
by: Brinkmann, Gunnar, et al.
Published: (2024)
by: Brinkmann, Gunnar, et al.
Published: (2024)
A combinatorial bound on the number of distinct eigenvalues of a graph
by: Allred, Sarah, et al.
Published: (2022)
by: Allred, Sarah, et al.
Published: (2022)
Classification of polyhedral graphs by numbers of common neighbours
by: Maffucci, Riccardo W.
Published: (2025)
by: Maffucci, Riccardo W.
Published: (2025)
Enumeratively Chromatic-Choosable Theta Graphs
by: Chi, Yanghong, et al.
Published: (2026)
by: Chi, Yanghong, et al.
Published: (2026)
On Polynomial Representations of Dual DP Color Functions
by: Mudrock, Jeffrey A., et al.
Published: (2024)
by: Mudrock, Jeffrey A., et al.
Published: (2024)
Enumerative Chromatic Choosability
by: Allred, Sarah, et al.
Published: (2025)
by: Allred, Sarah, et al.
Published: (2025)
Counting Packings of List-colorings of Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)
by: Kaul, Hemanshu, et al.
Published: (2024)
On the size and complexity of scrambles
by: Connor, Seamus, et al.
Published: (2023)
by: Connor, Seamus, et al.
Published: (2023)
Which Phylogenetic Networks are Level-k Networks with Additional Arcs? Structure and Algorithms
by: Suzuki, Takatora, et al.
Published: (2025)
by: Suzuki, Takatora, et al.
Published: (2025)
On the DP-chromatic Number of Cartesian Products of Critical Graphs
by: Kaul, Hemanshu, et al.
Published: (2025)
by: Kaul, Hemanshu, et al.
Published: (2025)
Gallai-Ramsey multiplicity for rainbow small trees
by: Li, Xueliang, et al.
Published: (2023)
by: Li, Xueliang, et al.
Published: (2023)
DP color functions of hypergraphs
by: Cui, Ruiyi, et al.
Published: (2025)
by: Cui, Ruiyi, et al.
Published: (2025)
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
by: Dong, Fengming, et al.
Published: (2022)
by: Dong, Fengming, et al.
Published: (2022)
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
by: Dong, Fengming, et al.
Published: (2023)
by: Dong, Fengming, et al.
Published: (2023)
Similar Items
-
Generating maps on oriented surfaces using the homomorphism principle
by: Brinkmann, Gunnar
Published: (2024) -
On the number of small edge-weighted subgraphs
by: Yu, Feng, et al.
Published: (2025) -
On the largest chromatic number of $F$-free hypergraphs
by: Wang, Yichen, et al.
Published: (2026) -
Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024) -
Reflexive Digraph Reconfiguration by Orientation Strings
by: Pullas, David Emmanuel Pazmiño, et al.
Published: (2025)