Toroidal graphs without $K_{5}^{-}$ and 6-cycles
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Ping, Wang, Tao |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Variable degeneracy of planar graphs without chorded 6-cycles
by: Fang, Huihui, et al.
Published: (2025)
by: Fang, Huihui, 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)
by: Liu, Zhengjiao, 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)
by: Wang, Tao, 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)
by: Kim, Seog-Jin, et al.
Published: (2025)
The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)
by: Kim, Seog-Jin, et al.
Published: (2025)
Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)
by: Fang, Shu, et al.
Published: (2026)
Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)
by: Jin, Ligang, et al.
Published: (2024)
Distance-balancing of cube-connected cycles graphs
by: Aouina, Mokhtar, et al.
Published: (2024)
by: Aouina, Mokhtar, et al.
Published: (2024)
On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)
by: Wang, Tao, et al.
Published: (2022)
A reduction of the "cycles plus $K_4$'s" problem
by: Dalal, Aseem, et al.
Published: (2024)
by: Dalal, Aseem, et al.
Published: (2024)
Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)
by: Lei, Hui, et al.
Published: (2024)
Maximum odd induced subgraph of a graph concerning its chromatic number
by: Wang, Tao, et al.
Published: (2022)
by: Wang, Tao, et al.
Published: (2022)
Optimization problem for star covers of graphs without four cycles
by: Bukovšek, Damjana Kokol, et al.
Published: (2026)
by: Bukovšek, Damjana Kokol, et al.
Published: (2026)
Universality for transversal Hamilton cycles in random graphs
by: Christoph, Micha, et al.
Published: (2025)
by: Christoph, Micha, et al.
Published: (2025)
Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
by: Hou, Jingxi, et al.
Published: (2025)
by: Hou, Jingxi, et al.
Published: (2025)
On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs
by: Hoàng, Chính T., et al.
Published: (2025)
by: Hoàng, Chính T., et al.
Published: (2025)
Graphs with girth $2\ell+1$ and without longer odd holes that contain an odd $K_4$-subdivision
by: Chen, Rong, et al.
Published: (2022)
by: Chen, Rong, et al.
Published: (2022)
Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)
by: Dvořák, Zdeněk, et al.
Published: (2024)
Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)
by: Fabrici, Igor, et al.
Published: (2025)
Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs
by: Wang, Yichen, et al.
Published: (2025)
by: Wang, Yichen, et al.
Published: (2025)
2-distance 20-coloring of planar graphs with maximum degree 6
by: Aoki, Kengo
Published: (2024)
by: Aoki, Kengo
Published: (2024)
Variable degeneracy on toroidal graphs
by: Li, Rui, et al.
Published: (2019)
by: Li, Rui, et al.
Published: (2019)
Subcubic graphs without eigenvalues in $(-1, 1)$
by: Huang, Shenwei, et al.
Published: (2026)
by: Huang, Shenwei, et al.
Published: (2026)
Coloring $(P_5, \text{gem})$-free graphs with $Δ-1$ colors
by: Cranston, Daniel W., et al.
Published: (2020)
by: Cranston, Daniel W., et al.
Published: (2020)
Rainbow cycles through specified vertices
by: Liu, Henry
Published: (2024)
by: Liu, Henry
Published: (2024)
S-packing chromatic critical paths and cycles
by: Ekinci, Gülnaz Boruzanlı, et al.
Published: (2026)
by: Ekinci, Gülnaz Boruzanlı, et al.
Published: (2026)
Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)
by: Bradshaw, Peter, et al.
Published: (2024)
Odd complete bipartite minors in graphs with independence number two
by: Chen, Rong, et al.
Published: (2025)
by: Chen, Rong, et al.
Published: (2025)
List rainbow connection number of graphs
by: Tang, Rongxia, et al.
Published: (2025)
by: Tang, Rongxia, et al.
Published: (2025)
Odd Hadwiger's conjecture for the complements of Kneser graphs
by: Chen, Meirun, et al.
Published: (2025)
by: Chen, Meirun, et al.
Published: (2025)
Strong edge-coloring of graphs with maximum edge weight seven
by: Wang, Runze
Published: (2025)
by: Wang, Runze
Published: (2025)
Perfect divisions in ($P_2 \cup P_4$, bull)-free graphs
by: Chen, Lizhong, et al.
Published: (2025)
by: Chen, Lizhong, et al.
Published: (2025)
Optimal stability results on color-biased Hamilton cycles
by: Chen, Wenchong, et al.
Published: (2025)
by: Chen, Wenchong, et al.
Published: (2025)
Chip games and multipartite graph paintability
by: Bradshaw, Peter, et al.
Published: (2024)
by: Bradshaw, Peter, et al.
Published: (2024)
Strong edge-coloring of sparse graphs with Ore-degree 7 or 8
by: Wang, Runze
Published: (2026)
by: Wang, Runze
Published: (2026)
Isolation partitions in graphs
by: Zhang, Gang, et al.
Published: (2024)
by: Zhang, Gang, et al.
Published: (2024)
An Erdos-Gallai conjecture for signed graphs
by: Wang, Lujia
Published: (2025)
by: Wang, Lujia
Published: (2025)
Bounds on Coloring Trees without Rainbow Paths
by: Goddard, Wayne, et al.
Published: (2025)
by: Goddard, Wayne, et al.
Published: (2025)
The local antimagic (total) chromatic numbers of firecracker graphs and edge-corona product graphs
by: Yang, Xue, et al.
Published: (2026)
by: Yang, Xue, et al.
Published: (2026)
On graphs without four-vertex induced subgraphs
by: Cameron, Kathie, et al.
Published: (2025)
by: Cameron, Kathie, et al.
Published: (2025)
Similar Items
-
Variable degeneracy of planar graphs without chorded 6-cycles
by: Fang, Huihui, 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) -
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) -
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 a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)