:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Henderschedt, Owen, McDonald, Jessica
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2509.18940
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
by: Anderson, James, et al.
Published: (2024)

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

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

On graphs with girth at least five achieving Steffen's edge coloring bound
by: Chen, Guantao, et al.
Published: (2026)

Coloring graphs with independence number two and no odd clique immersions
by: Echeverría, Henry, et al.
Published: (2026)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

A finite victory over de Bruijn-Erdős in interval discrepancy
by: DeLeo, Jared, et al.
Published: (2026)

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

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

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

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

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

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

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

Graphs generated from minimal sets of finite point-set topologies
by: Chen, Ketai, et al.
Published: (2025)

Maximizing the number of stars in graphs with forbidden properties
by: Berikkyzy, Zhanar, et al.
Published: (2025)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

Degree sequences realizing labelled perfect matchings
by: Briggs, Joseph, et al.
Published: (2025)

Proper edge colorings of planar graphs with rainbow $C_4$-s
by: Gyárfás, András, et al.
Published: (2024)

Characterization of cycle obstruction sets for improper coloring planar graphs
by: Choi, Ilkyoo, et al.
Published: (2018)

Extremal graph theory and point configurations in Ahlfors-David regular sets
by: McDonald, Alex
Published: (2026)

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

A 2-distance $(2Δ+7)$-coloring of planar graphs
by: Deniz, Zakir
Published: (2024)

A reduction of the "cycles plus $K_4$'s" problem
by: Dalal, Aseem, et al.
Published: (2024)

Optimally reconnecting graphs against an edge-destroying adversary
by: McDonald, Daniel C.
Published: (2021)

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

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
by: Kidner, Arnott, et al.
Published: (2025)

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

Extending graph total colorings to cell complexes
by: Dejter, Italo J.
Published: (2026)

Pancyclicity of almost-planar graphs
by: Adams, Santiago T., et al.
Published: (2024)

Some results on 2-distance coloring of planar graphs with girth five
by: Deniz, Zakir
Published: (2023)

2-distance 20-coloring of planar graphs with maximum degree 6
by: Aoki, Kengo
Published: (2024)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Extending edge colorings of distance-3 matchings in the Cartesian product of graphs
by: Bärnkopf, Pál, et al.
Published: (2023)

Extending partial edge-colorings of bounded size in Cartesian products of graphs
by: Bärnkopf, Pál, et al.
Published: (2026)

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

On 2-distance 16-coloring of planar graphs with maximum degree at most five
by: Deniz, Zakir
Published: (2023)

3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)