Cover Image

The square of a subcubic planar graph without a 5-cycle is 7-choosable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kim, Seog-Jin, Lian, Xiaopan, Nakamoto, Atsuhiro, Ozeki, Kenta
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
by: Jin, Ligang, et al.
Published: (2025)

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

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

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

Odd coloring of $k$-trees
by: Kashima, Masaki, et al.
Published: (2025)

Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
by: Noguchi, Kenta
Published: (2019)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

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

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

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)

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

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

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

Median eigenvalues of subcubic graphs
by: Acharya, Hricha, et al.
Published: (2025)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
by: Deng, Kecai, et al.
Published: (2025)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

Minimal abundant packings and choosability with separation
by: Furedi, Zoltan, et al.
Published: (2013)

On the hat guessing number of a planar graph class
by: Bradshaw, Peter
Published: (2021)

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

Rainbow planar Tur{á}n numbers of cycles
by: Liu, Xiaonan
Published: (2025)

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

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

On a conjecture about the strong odd chromatic number of planar graphs
by: Manattu, Arun J, et al.
Published: (2026)

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)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

Distance-balancing of cube-connected cycles graphs
by: Aouina, Mokhtar, et al.
Published: (2024)

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

Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024)

Spanning bipartite quadrangulations of triangulations of the projective plane
by: Noguchi, Kenta
Published: (2022)

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

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)

Optimization problem for star covers of graphs without four cycles
by: Bukovšek, Damjana Kokol, et al.
Published: (2026)

Solution to a $3$-path isolation problem for subcubic graphs
by: Bartolo, Karl, et al.
Published: (2024)

Universality for transversal Hamilton cycles in random graphs
by: Christoph, Micha, et al.
Published: (2025)

Isolation partitions in graphs
by: Zhang, Gang, et al.
Published: (2024)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

Coalition graphs of connected domination partitions in subcubic graphs
by: Dobrynin, Andrey A., et al.
Published: (2025)