Image de couverture de livre

Extending total colorings in planar graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Henderschedt, Owen, McDonald, Jessica
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Total coloring graphs with large minimum degree
par: Henderschedt, Owen, et autres
Publié: (2025)

On orientations with forbidden out-degrees
par: Henderschedt, Owen, et autres
Publié: (2024)

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
par: Anderson, James, et autres
Publié: (2024)

Total coloring graphs with large maximum degree
par: Dalal, Aseem, et autres
Publié: (2024)

On graphs with girth at least five achieving Steffen's edge coloring bound
par: Chen, Guantao, et autres
Publié: (2026)

Shrinking the Jung radius: Maximizing partial coverage of finite point sets
par: Bezdek, András, et autres
Publié: (2024)

Coloring graphs with independence number two and no odd clique immersions
par: Echeverría, Henry, et autres
Publié: (2026)

On graphs with chromatic number and maximum degree both equal to nine
par: Galindo, Rachel, et autres
Publié: (2024)

A finite victory over de Bruijn-Erdős in interval discrepancy
par: DeLeo, Jared, et autres
Publié: (2026)

Equitable coloring of graphs beyond planarity
par: Liu, Weichan
Publié: (2025)

Note on robust coloring of planar graphs
par: Kardoš, František, et autres
Publié: (2024)

Defective correspondence coloring of planar graphs
par: Anderson, James
Publié: (2024)

Semistrong edge colorings of planar graphs
par: Lin, Yuquan, et autres
Publié: (2024)

The interval coloring impropriety of planar graphs
par: Lee, Seunghun
Publié: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
par: Deniz, Zakir, et autres
Publié: (2025)

Odd Ramsey numbers of multipartite graphs and hypergraphs
par: Crawford, Nicholas, et autres
Publié: (2025)

Proper edge colorings of planar graphs with rainbow $C_4$-s
par: Gyárfás, András, et autres
Publié: (2024)

Characterization of cycle obstruction sets for improper coloring planar graphs
par: Choi, Ilkyoo, et autres
Publié: (2018)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
par: Galindo, Rachel, et autres
Publié: (2025)

Degree sequences realizing labelled perfect matchings
par: Briggs, Joseph, et autres
Publié: (2025)

Maximizing the number of stars in graphs with forbidden properties
par: Berikkyzy, Zhanar, et autres
Publié: (2025)

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

A 2-distance $(2Δ+7)$-coloring of planar graphs
par: Deniz, Zakir
Publié: (2024)

Graphs generated from minimal sets of finite point-set topologies
par: Chen, Ketai, et autres
Publié: (2025)

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
par: Kidner, Arnott, et autres
Publié: (2025)

Between proper and square colorings of planar graphs with maximum degree at most four
par: Liu, Xujun, et autres
Publié: (2026)

Extremal graph theory and point configurations in Ahlfors-David regular sets
par: McDonald, Alex
Publié: (2026)

A reduction of the "cycles plus $K_4$'s" problem
par: Dalal, Aseem, et autres
Publié: (2024)

Pancyclicity of almost-planar graphs
par: Adams, Santiago T., et autres
Publié: (2024)

B-colorings of planar and outerplanar graphs
par: Martin, Ryan R., et autres
Publié: (2024)

Extending edge colorings of distance-3 matchings in the Cartesian product of graphs
par: Bärnkopf, Pál, et autres
Publié: (2023)

Extending partial edge-colorings of bounded size in Cartesian products of graphs
par: Bärnkopf, Pál, et autres
Publié: (2026)

Optimally reconnecting graphs against an edge-destroying adversary
par: McDonald, Daniel C.
Publié: (2021)

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

2-distance 20-coloring of planar graphs with maximum degree 6
par: Aoki, Kengo
Publié: (2024)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
par: La, Hoang, et autres
Publié: (2021)

Extending graph total colorings to cell complexes
par: Dejter, Italo J.
Publié: (2026)

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

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

Counting colored planar maps: algebraicity results
par: Bernardi, Olivier, et autres
Publié: (2009)