Cover Image

Strong parity edge-colorings of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bradshaw, Peter, Norin, Sergey, West, Douglas B.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Defective coloring of blowups
by: Norin, Sergey, et al.
Published: (2025)

Limits of degeneracy for colouring graphs with forbidden minors
by: Norin, Sergey, et al.
Published: (2023)

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

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

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

Single-conflict colorings of degenerate graphs
by: Bradshaw, Peter, et al.
Published: (2021)

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

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

On the hat guessing number of a planar graph class
by: Bradshaw, Peter
Published: (2021)

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

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)

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

Paintability of $r$-chromatic graphs
by: Bradshaw, Peter, et al.
Published: (2024)

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

Flexible DP 3-coloring of sparse multigraphs
by: Bradshaw, Peter, et al.
Published: (2025)

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

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

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)

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

Hat guessing number and guaranteed subgraphs
by: Bradshaw, Peter
Published: (2021)

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

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)

Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
by: Brešar, Boštjan, et al.
Published: (2024)

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

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

Sparsity of 3-flow critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

On the interval coloring impropriety of graphs
by: Carr, MacKenzie, et al.
Published: (2023)

On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)

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

The edge chromatic transformation index of graphs
by: Asratian, Armen S., et al.
Published: (2025)

Equitable list coloring of sparse graphs
by: Kierstead, H. A., 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)

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

A note on transformations of edge colorings of chordless graphs and triangle-free graphs
by: Asratian, Armen
Published: (2024)

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

Regular graphs are universally 3-edge-weightable
by: Deng, Kecai
Published: (2026)

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