Cover Image

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anderson, James, Chau, Herman, Cho, Eun-Kyung, Crawford, Nicholas, Hartke, Stephen G., Heath, Emily, Henderschedt, Owen, Kwon, Hyemin, Zhang, Zhiyuan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extending total colorings in planar graphs
by: Henderschedt, Owen, et al.
Published: (2025)

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

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

Odd Ramsey numbers of multipartite graphs and hypergraphs
by: Crawford, Nicholas, et al.
Published: (2025)

Brooks-type theorems for relaxations of square colorings
by: Cho, Eun-Kyung, et al.
Published: (2023)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
by: Ahn, Jungho, et al.
Published: (2022)

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

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

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

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

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

Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)

Defective correspondence coloring of planar graphs
by: Anderson, James
Published: (2024)

The maximum number of odd cycles in a planar graph
by: Emily Heath, et al.
Published: (2024)

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, et al.
Published: (2026)

Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
by: Liu, Chun-Hung
Published: (2022)

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

On strong odd colorings of graphs
by: Caro, Yair, et al.
Published: (2024)

On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
by: Lee, Seunghun, et al.
Published: (2024)

Between proper and square colorings of sparse graphs
by: Choi, Ilkyoo, et al.
Published: (2025)

Sphere packing proper colorings of an expander graph
by: Zhu, Honglin
Published: (2024)

Obstructions for homomorphisms to odd cycles in series-parallel graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

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

Note on robust coloring of planar graphs
by: Kardoš, František, et al.
Published: (2024)

Semistrong edge colorings of planar graphs
by: Lin, Yuquan, et al.
Published: (2024)

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

The interval coloring impropriety of planar graphs
by: Lee, Seunghun
Published: (2024)

Equitable coloring of graphs beyond planarity
by: Liu, Weichan
Published: (2025)

Defective acyclic colorings of planar graphs
by: On‐Hei Solomon Lo, et al.
Published: (2024)

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

Shrinking the Jung radius: Maximizing partial coverage of finite point sets
by: Bezdek, András, et al.
Published: (2024)

On the on-line coloring of unit interval graphs with proper interval representation
by: Curbelo, Israel R., et al.
Published: (2024)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Hat guessing with proper colorings
by: Adriaensen, Sam, et al.
Published: (2026)

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

Odd coloring of 2-boundary planar graphs and beyond
by: Liu, Weichan, et al.
Published: (2022)

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

On orientations with forbidden out-degrees
by: Henderschedt, Owen, et al.
Published: (2024)

Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
by: Banerjee, Amitayu, et al.
Published: (2023)

The complexity of strong conflict-free vertex-connection $k$-colorability
by: Hsieh, Sun-Yuan, et al.
Published: (2024)