Cover Image

2-factors in $\frac{3}{2}$-tough maximal planar graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hao, Lili, Ma, Hui, Shan, Songling, Yang, Weihua
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

A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
by: Shan, Songling
Published: (2022)

Hamiltonian cycles in $ 15 $-tough ($ P_{3}\cup 3P_{1} $)-free graphs
by: Ma, Hui, et al.
Published: (2025)

Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
by: Shan, Songling, et al.
Published: (2025)

Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs
by: Shan, Songling
Published: (2025)

Degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2024)

A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2025)

Equitable tree colouring of graphs
by: Gao, Yuping, et al.
Published: (2026)

Towards the Overfull Conjecture
by: Shan, Songling
Published: (2023)

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs
by: Gao, Yuping, et al.
Published: (2024)

Vertex-distinguishing edge coloring of graphs
by: Gao, Yuping, et al.
Published: (2025)

A sufficient condition for a hypergraph to have a Berge-$k$-factor
by: Gao, Yuping, et al.
Published: (2023)

On the number of edges in saturated partial embeddings of maximal planar graphs
by: Barát, János, et al.
Published: (2025)

Fractional factors and component factors in graphs with isolated toughness smaller than 1
by: Wolf, Isaak H.
Published: (2023)

Spanning Euler Tours in Hypergraphs
by: Bahmanian, Amin, et al.
Published: (2024)

Linear arboricity of robust expanders
by: Gao, Yuping, et al.
Published: (2024)

Graceful Labeling of Two Families of Spiders
by: Shan, Songling, et al.
Published: (2026)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Minimally tough series-parallel graphs with toughness at least $1/2$
by: Katona, Gyula Y., et al.
Published: (2025)

Tricyclic graphs for which the second largest distance eigenvalue less than $-\frac{1}{2}$
by: Yang, Kexin, et al.
Published: (2025)

Constructions of minimally $t$-tough regular graphs
by: Cheng, Kun, et al.
Published: (2024)

Spectral radius, toughness and $k$-factor of graphs
by: Chen, Yuanyuan, et al.
Published: (2026)

On minimal k-factor-critical planar graphs
by: Li, Qiuli, et al.
Published: (2025)

Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
by: Li, Ping
Published: (2025)

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
by: Pereyra, Kevin
Published: (2026)

A note on optimal 2-planar graphs
by: Zhang, Licheng, et al.
Published: (2025)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
by: Liu, Xiangge, et al.
Published: (2025)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

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

A graph for which the second largest distance eigenvalue is less than $\frac{-3+\sqrt{5}}{2}$ is chordal
by: Guo, Haiyan, et al.
Published: (2023)

Minimal toughness in special graph classes
by: Katona, Gyula Y., et al.
Published: (2018)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

Degree sequences realizing labelled perfect matchings
by: Briggs, Joseph, et al.
Published: (2025)

A 2-distance $(2Δ+7)$-coloring of planar graphs
by: Deniz, Zakir
Published: (2024)

A spectral condition for Hamilton cycles in tough bipartite graphs
by: Ai, Lianyang, et al.
Published: (2025)

On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

The density of maximal IC-plane graphs and maximal NIC-plane graphs
by: Ding, Zongpeng, et al.
Published: (2025)

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

Erdős' problem and $(n, \frac{1}{3})$-separated sets
by: Shi, Enhui, et al.
Published: (2024)