Cover Image

Partitioning triangle-free planar graphs into a forest and a linear forest

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Guanwu, Xu, Rongxing
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 strong fractional choice number of triangle-free planar graphs
by: Hu, Xiaolan, et al.
Published: (2026)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

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

Blowups of triangle-free graphs
by: Girão, António, et al.
Published: (2024)

Decomposing cubic graphs into isomorphic linear forests
by: Kronenberg, Gal, et al.
Published: (2022)

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

Turán type problems for a fixed graph and a linear forest
by: Zhang, Haixiang, et al.
Published: (2025)

On the evolution of structure in triangle-free graphs
by: Jenssen, Matthew, et al.
Published: (2023)

The maximum spectral radius of planner graphs without the joint of K2 and a linear forest
by: Xu, Weilun, 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)

Spanning forests in regular planar maps
by: Bousquet-Mélou, Mireille, et al.
Published: (2013)

Connectivity keeping trees in triangle-free graphs
by: Chu, Hojin, et al.
Published: (2025)

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

Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
by: Cheng, Kun, et al.
Published: (2024)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

Suns in triangle-free graphs of large chromatic number
by: Hajebi, Sepehr, et al.
Published: (2025)

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

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Extremal triangle-free graphs with chromatic number at least four
by: Ren, Sijie, et al.
Published: (2024)

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

Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs
by: Abrishami, Tara, et al.
Published: (2023)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

Three-coloring triangle-free graphs without long forbidden paths
by: Zhou, Yidong, et al.
Published: (2025)

Dense triangle-free $(n, d, λ)$-graphs for all orders
by: Kim, Jaehoon, et al.
Published: (2024)

Proof of a conjecture of Voss on bridges of longest cycles
by: Ma, Jie, et al.
Published: (2025)

Coloring triangles in graphs
by: Basu, Ayush, et al.
Published: (2024)

On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)

On asymptotic values for the minimum number of spanning forests in simple regular graphs
by: Xu, Shaohan, et al.
Published: (2026)

The maximum number of triangles in $K_{1,s,t}$-free graphs
by: Calbet, Asier, et al.
Published: (2025)

Rainbow common graphs must be forests
by: Sun, Yihang
Published: (2023)

Tree-width of a graph excluding an apex-forest or a wheel as a minor
by: Liu, Chun-Hung, et al.
Published: (2025)

Spectral extremal results for triangle-free graphs with chromatic number at least four
by: Zhu, Yinfen, et al.
Published: (2026)

Structure and linear-Pollyanna for some square-free graphs
by: Chen, Ran, et al.
Published: (2024)

Counting triangles in regular graphs
by: He, Jialin, et al.
Published: (2023)

A lower bound on the saturation number and a strengthening for triangle-free graphs
by: Buchanan, Calum, et al.
Published: (2024)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

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

Perfect tilings with the generalised triangle in $k$-graphs
by: Liu, Weichan, et al.
Published: (2025)