Cover Image

Cyclically $5$-edge-connected snarks with resistance $2$ and flow resistance $n$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mattiolo, Davide, Negrini, Pietro, Pagani, Silvia M. C.
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C15, 05C21, 05C40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On removable edge subsets in graphs with a nowhere-zero $4$-flow
by: Mattiolo, Davide
Published: (2025)

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
by: Sedlar, Jelena, et al.
Published: (2023)

Strictly critical snarks with girth or cyclic connectivity equal to 6
by: Mazák, Ján, et al.
Published: (2024)

Geometric description of $d$-dimensional flows of a graph
by: Mattiolo, Davide, et al.
Published: (2025)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

On essentially 4-edge-connected cubic bricks
by: Kothari, Nishad, et al.
Published: (2018)

The wild number of an edge-colored graph
by: Anders, Katie, et al.
Published: (2025)

Resistance, oddness and colouring defect of snarks
by: Allie, Imran
Published: (2024)

The immersion-minimal infinitely edge-connected graph
by: Knappe, Paul, et al.
Published: (2022)

Generalized Token Graphs
by: Herrera-Ramirez, C. Amairani, et al.
Published: (2025)

Probability model of edge-fault tolerance for regular graphs with respect to edge connectivity
by: Jia, Huanshen, et al.
Published: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
by: Polavarapu, Achintya Raya
Published: (2026)

Planar Graphs with Homomorphisms to the 9-cycle
by: Cranston, Daniel W., et al.
Published: (2024)

Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi
by: Karabáš, Ján, et al.
Published: (2025)

Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)

Nowhere-zero 8-flows in 3-edge-connected signed graphs
by: DeVos, Matt, et al.
Published: (2025)

Rainbow Connection for Complete Multipartite Graphs
by: Araujo, Igor, et al.
Published: (2022)

Spanning tight components in 4-uniform hypergraphs
by: Di Braccio, Francesco, et al.
Published: (2026)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
by: Abreu, M., et al.
Published: (2024)

Bouchet's conjecture for cyclically 5-edge-connected, cubic signed graphs
by: Nurse, Kathryn
Published: (2026)

Proper Z4 x Z2-colorings: structural characterization with application to some snarks
by: Sedlar, Jelena, et al.
Published: (2024)

Counting $k$-cycles in $5$-connected planar triangulations
by: Agrahari, Gyaneshwar, et al.
Published: (2025)

Characterizing finite groups whose order supergraphs satisfy a connectivity condition
by: Panda, Ramesh Prasad, et al.
Published: (2025)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
by: Adauto, Matheus, et al.
Published: (2023)

Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
by: Burnette, Charles, et al.
Published: (2025)

Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
by: Ji, Meng, et al.
Published: (2021)

Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)

Vertex-partitions of 2-edge-colored graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
by: Chu, Hojin, et al.
Published: (2025)

Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)

The average connectivity matrix of a graph
by: Nguyen, Linh, et al.
Published: (2022)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Injective (edge) colorings of generalized Sierpiński graphs
by: Bhanupriya, C. K., et al.
Published: (2025)

On an induced version of Menger's theorem
by: Hendrey, Kevin, et al.
Published: (2023)

Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)

Proof of the linkage conjecture for highly connected tournaments
by: Zhou, Jia, et al.
Published: (2025)

Critical edge sets in vertex-critical graphs
by: Skottova, Ema, et al.
Published: (2025)

The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)