Cover Image

Three-cuts are a charm: acyclicity in 3-connected cubic graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kardoš, František, Máčajová, Edita, Zerafa, Jean Paul
Format:	Preprint
Published:	2023
Subjects:	Combinatorics 05C15, 05C70
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On $4$-covers of cubic graphs with two adjacent odd circuits in a $2$-factor
by: Karabáš, Ján, et al.
Published: (2026)

Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson
by: Karabáš, Ján, et al.
Published: (2023)

Berge's conjecture for cubic graphs with small colouring defect
by: Karabáš, Ján, et al.
Published: (2022)

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

On covering cubic graphs with three perfect matchings
by: Máčajová, Edita, et al.
Published: (2025)

Disjoint Correspondence Colorings for $K_5$-Minor-free Graphs
by: van Batenburg, Wouter Cames, et al.
Published: (2026)

The Pairing-Hamiltonian property in graph prisms
by: Abreu, Marién, et al.
Published: (2023)

Expanding vertices to triangles in cubic graphs
by: Mazzuoccolo, Giuseppe, et al.
Published: (2025)

Saved by the rook: a case of matchings and Hamiltonian cycles
by: Abreu, Marién, et al.
Published: (2021)

Non-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphs
by: Mkrtchyan, Vahan
Published: (2024)

Strong majority colorings of graphs
by: Kalinowski, Rafał, et al.
Published: (2026)

Uniformly balanced $H$-factors in multicoloured complete graphs
by: Banerjee, Agnijo, 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)

Toward a Three-dimensional Counterpart of Cruse's Theorem
by: Bahmanian, Amin
Published: (2022)

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

Monochromatic graph decompositions inspired by anti-Ramsey colorings
by: Caro, Yair, et al.
Published: (2024)

The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs
by: Colangelo, Francesco, et al.
Published: (2024)

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

Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
by: Heering, Philipp, et al.
Published: (2026)

Tight factorizations of girth-$g$-regular graphs
by: Dejter, Italo J.
Published: (2021)

A note on the $k$-defect number: Vertex Coloring with a Fixed Number of Monochromatic Edges
by: Mphako-Banda, Eunice, et al.
Published: (2025)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)

Tight Bounds on the Chromatic Edge Stability Index of Graphs
by: Akbari, Saieed, et al.
Published: (2022)

On acyclic b-chromatic number of cubic graphs
by: Anholcer, Marcin, et al.
Published: (2025)

Efficient total colorings of cubic maps of girth 4 and related topics
by: Dejter, Italo J
Published: (2026)

A constructive solution to the Oberwolfach Problem with a large cycle
by: Traetta, Tommaso
Published: (2023)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

Spectral radius and perfect k-matchings in t-connected graphs
by: Pan, Quanru, et al.
Published: (2026)

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

Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)

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

Bell coloring graphs: realizability and reconstruction
by: Asgarli, Shamil, et al.
Published: (2025)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

An 8-flow theorem for signed graphs
by: Luo, Rong, et al.
Published: (2024)

List strong and list normal edge-coloring of (sub)cubic graphs
by: Lužar, Borut, et al.
Published: (2024)

Constructing reflection-symmetric flexible realisations of graphs
by: Dewar, Sean, et al.
Published: (2024)

The linear system for Sudoku and a fractional completion threshold
by: Dukes, Peter J., et al.
Published: (2023)

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024)