Imagen de Portada

On odd colorings of sparse graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Tao, Yang, Xiaojing
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics 05C15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
por: Liu, Zhengjiao, et al.
Publicado: (2025)

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

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
por: Wang, Tao, et al.
Publicado: (2025)

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

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

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

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

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

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

Counting subgraphs of coloring graphs
por: Asgarli, Shamil, et al.
Publicado: (2024)

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

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

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

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

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

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

Counterexamples to two conjectures on mean color numbers of graphs
por: Zhai, Wushuang, et al.
Publicado: (2024)

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

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

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

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

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

Injective coloring of product graphs
por: Samadi, Babak, et al.
Publicado: (2023)

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

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

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

On the 3-colorability of triangle-free and fork-free graphs
por: Schroeder, Joshua, et al.
Publicado: (2021)

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

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

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

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

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

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

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

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