Cover Image

Strong odd coloring of sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kwon, Hyemin, Park, Boram
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

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

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

Equitable list coloring of sparse graphs
by: Kierstead, H. A., et al.
Published: (2024)

Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)

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

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

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

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

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

Totally odd subdivisions in Kneser graphs
by: Echeverría, Henry, et al.
Published: (2025)

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

Boundedness for proper conflict-free and odd colorings
by: Jiménez, Andrea, et al.
Published: (2023)

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)

Coloring small locally sparse degenerate graphs and related problems
by: Bradač, Domagoj, et al.
Published: (2026)

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

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

Totally odd immersions in line graphs
by: Jiménez, Andrea, et al.
Published: (2023)

Maximum odd induced subgraph of a graph concerning its chromatic number
by: Wang, Tao, et al.
Published: (2022)

The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, 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)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)

On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)

Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)

On a conjecture about the strong odd chromatic number of planar graphs
by: Manattu, Arun J, et al.
Published: (2026)

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

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

Castling tree of tight Dyck nests with applications to odd and middle-levels graphs
by: Dejter, Italo J.
Published: (2023)

B-colorings of planar and outerplanar graphs
by: Martin, Ryan R., et al.
Published: (2024)

An introduction to equitable DP coloring of graphs
by: Kierstead, H. A., et al.
Published: (2026)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

Upper bounds on the odd graceful chromatic number of graphs
by: Afifurrahman, Muhammad, et al.
Published: (2025)

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

$S$-packing colorings of distance graphs with distance sets of cardinality $2$
by: Brešar, Boštjan, et al.
Published: (2024)

Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
by: Belavadi, M., et al.
Published: (2025)

On a conjecture concerning 4-coloring of graphs with one crossing
by: Dvořák, Zdeněk, et al.
Published: (2025)

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