Cover Image

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jin, Ligang, Kang, Yingli, Kim, Seog-Jin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

Minimum saturated graphs without $4$-cycles and $5$-cycles
by: Ma, Yue
Published: (2025)

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

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

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

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

Variable degeneracy of planar graphs without chorded 6-cycles
by: Fang, Huihui, et al.
Published: (2025)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

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

Triangles in graphs without the expansion of $4$-cycle
by: Song, Jialei, et al.
Published: (2026)

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

An improved integrality gap for disjoint cycles in planar graphs
by: Schlomberg, Niklas
Published: (2024)

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

The square of a Hamilton cycle in randomly perturbed graphs
by: Böttcher, Julia, et al.
Published: (2022)

A note on cycles in cyclically $4$-edge-connected cubic planar graphs
by: Lo, On-Hei Solomon
Published: (2026)

Improved Erdős-Pósa inequalities for odd cycles in planar graphs
by: Puhlmann, Luise, et al.
Published: (2025)

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

Max-Bisections of graphs without even cycles
by: Hou, Jianfeng, et al.
Published: (2025)

Every signed planar graph is $5$-choosable: A short proof and refinements
by: Atangana, Pie Desire Ebode, et al.
Published: (2026)

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)

A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
by: Zhang, Jie, et al.
Published: (2022)

Toroidal graphs without $K_{5}^{-}$ and 6-cycles
by: Chen, Ping, et al.
Published: (2025)

Frustration indices of signed subcubic graphs
by: Chen, Sirui, et al.
Published: (2025)

Counting cycles in planar triangulations
by: Lo, On-Hei Solomon, et al.
Published: (2022)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)

The independence ratio of 4-cycle-free planar graphs
by: Kelly, Tom, et al.
Published: (2023)

On graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2025)

Weak diameter choosability of graphs with an excluded minor
by: Crouch, Joshua, et al.
Published: (2023)

Generalized Petersen graphs are (1,3)-choosable
by: Tang, Yunfang, et al.
Published: (2024)

Spectral conditions for the existence of chorded cycles in graphs with fixed size
by: Cai, Jin, et al.
Published: (2024)

Spectral conditions for graphs in which every edge belongs to a factor
by: Cai, Jin, et al.
Published: (2024)

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

On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)

Signless Laplacian index conditions for doubly chorded cycles in graphs with given order
by: Cai, Jin, et al.
Published: (2025)

Signless Laplacian index conditions for trebly chorded cycles in graphs with given order
by: Cai, Jin, et al.
Published: (2026)

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

Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
by: Hou, Jianfeng, et al.
Published: (2024)