Cover Image

The Total Coloring Conjecture holds for planar graphs without three special subgraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Su, Rongjin, Fang, Gang, Zhu, Enqiang
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 Gamma-Theta Conjecture holds for planar graphs
by: Taletskii, Dmitrii
Published: (2024)

Non-bipartite graphs without theta subgraphs
by: Fang, Longfei, et al.
Published: (2025)

The List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs
by: Hasanvand, Morteza
Published: (2022)

The spectral radius of $1$-planar graphs without complete subgraphs
by: Xu, Weilun, et al.
Published: (2025)

Coloring graphs with forbidden almost bipartite subgraphs
by: Anderson, James, et al.
Published: (2022)

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
by: Song, Zi-Xia, et al.
Published: (2025)

Decomposition of toroidal graphs without some subgraphs
by: Wang, Tao, et al.
Published: (2025)

List-3-Coloring ordered graphs with a forbidden induced subgraph
by: Hajebi, Sepehr, et al.
Published: (2022)

Non-r-partite graphs without complete split subgraphs
by: Wang, Bing, et al.
Published: (2025)

Guarding isometric subgraphs and Cops and Robber in planar graphs
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024)

The largest subgraph without a forbidden induced subgraph
by: Fox, Jacob, et al.
Published: (2024)

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

On graphs without four-vertex induced subgraphs
by: Cameron, Kathie, et al.
Published: (2025)

Extremal 1-planar graphs without k-cliques
by: Zhang, Licheng, et al.
Published: (2026)

Packing subgraphs in regular graphs
by: Letzter, Shoham, et al.
Published: (2025)

Antidirected subgraphs of oriented graphs
by: Stein, Maya, et al.
Published: (2022)

Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
by: Egawa, Yoshimi, et al.
Published: (2024)

Non-isomorphic subgraphs in random graphs
by: Krivelevich, Michael, et al.
Published: (2025)

Rainbow subgraphs of star-coloured graphs
by: Lo, Allan, et al.
Published: (2025)

Counting subgraphs in locally dense graphs
by: Bradač, Domagoj, et al.
Published: (2024)

Maximum chordal subgraphs of random graphs
by: Krivelevich, Michael, et al.
Published: (2023)

Proving Norine's Conjecture holds for $n=7$ via SAT solvers
by: Frankston, Keith, et al.
Published: (2024)

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

Extremal spectral results of planar graphs without $C_{l, l}$ or $\mathrm{Theta}$ graph
by: Zhang, HaoRan, et al.
Published: (2024)

Quasi-tree-partitions of graphs with an excluded subgraph
by: Liu, Chun-Hung, et al.
Published: (2024)

Coloring of graphs without long odd holes
by: Chen, Ran, et al.
Published: (2025)

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

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

Pancyclicity of almost-planar graphs
by: Adams, Santiago T., et al.
Published: (2024)

Decompositions of graphs with degree constraints relative to prescribed subgraphs
by: Wei, Peichao, et al.
Published: (2025)

Rainbow subgraphs of uniformly coloured randomly perturbed graphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

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

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

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

Proof of Brouwers Conjecture (BC) for all graphs with number of vertices n > n_0 assuming that BC holds for n< n_0 for some n_0
by: Blinovsky, Vladimir, et al.
Published: (2019)

Seymour and Woodall's conjecture holds for graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)

How to find all extremal graphs using symmetric subgraphs
by: Zhang, Wenqian
Published: (2025)

On constructing small subgraphs in the budget-constrained random graph process
by: Antoniuk, Sylwia, et al.
Published: (2026)