Cover Image

Between proper and square colorings of planar graphs with maximum degree at most four

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Xujun, Xu, Zihui, Zhang, Xin
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Partition subcubic planar graphs into independent sets
by: Liu, Xujun, et al.
Published: (2024)

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

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
by: Liu, Xujun, et al.
Published: (2026)

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

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
by: Liu, Xujun, et al.
Published: (2024)

Injective edge-coloring of graphs with small maximum degree
by: Huang, Danjun, et al.
Published: (2025)

Packing edge-colorings of subcubic outerplanar graphs
by: Li, Sijin, et al.
Published: (2024)

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

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

Majority additive coloring and the maximum degree
by: Brause, Christoph, et al.
Published: (2025)

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

On the maximum spectral radius of planar graphs
by: Yu, Guanglong, et al.
Published: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Approximating maximum-size properly colored forests
by: Bai, Yuhang, et al.
Published: (2024)

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

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

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

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

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)

On the Borodin--Kostochka conjecture for graphs with large maximum degree
by: Liu, Feng, et al.
Published: (2026)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

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

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

The maximum number of $k$-cliques of 7-connected 1-planar graphs
by: Huang, Yuanqiu, et al.
Published: (2026)

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

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

On the maximum partial-dual genus of a planar graph
by: Chen, Jiaying, et al.
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

The maximum number of triangles in graphs without the square of a path
by: Wang, Yichen, et al.
Published: (2026)