Cover Image

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sedlar, Jelena, Škrekovski, Riste
Format:	Preprint
Published:	2023
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Cyclically $5$-edge-connected snarks with resistance $2$ and flow resistance $n$
by: Mattiolo, Davide, et al.
Published: (2026)

Fault tolerance of metric basis can be expensive
by: Knor, Martin, et al.
Published: (2024)

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

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

Results on proper conflict-free list coloring of graphs
by: Kashima, Masaki, et al.
Published: (2025)

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)

Invitation to the subpath number
by: Knor, Martin, et al.
Published: (2025)

Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)

Counting geodesic paths in graphs
by: Knor, Martin, et al.
Published: (2026)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
by: Kashima, Masaki, et al.
Published: (2025)

A note on vertex-critical induced subgraphs of shift graphs
by: Kaiser, Tomáš, et al.
Published: (2026)

Criticality in Sperner's Lemma
by: Kaiser, Tomáš, et al.
Published: (2023)

The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)

Strong edge-coloring of graphs with maximum edge weight seven
by: Wang, Runze
Published: (2025)

Some results on $σ_{t}$-irregularity
by: Filipovski, Slobodan, et al.
Published: (2024)

A biased edge coloring game
by: Wang, Runze
Published: (2024)

Strong parity edge-colorings of graphs
by: Bradshaw, Peter, et al.
Published: (2024)

On regular graphs with Šoltés vertices
by: Bašić, Nino, et al.
Published: (2023)

The only Class 0 Flower snark is the smallest
by: Bridi, Guilherme Adamatti, et al.
Published: (2025)

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

Star edge coloring of generalized Petersen graphs
by: Dastjerdi, Behnaz Omoomi Marzieh Vahid
Published: (2024)

Interval edge-colorings of Cartesian products of graphs II
by: Petrosyan, Petros A., et al.
Published: (2024)

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

Strong edge-coloring of sparse graphs with Ore-degree 7 or 8
by: Wang, Runze
Published: (2026)

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
by: Hou, Jingxi, et al.
Published: (2025)

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

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

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

Asymptotic number of edge-colored regular graphs
by: Borinsky, Michael, et al.
Published: (2026)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)

Coloring $(P_5, \text{gem})$-free graphs with $Δ-1$ colors
by: Cranston, Daniel W., et al.
Published: (2020)

Chromatic numbers for facet colouring of some generalised associahedra
by: Baralic, Djordje, et al.
Published: (2023)

On harmonious coloring of hypergraphs
by: Czerwiński, Sebastian
Published: (2022)