Cover Image

The minimum size of a $k$-connected locally nonforesty graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Chengli, Tang, Yurui, Zhan, Xingzhi
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C35, 05C38, 05C40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)

Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)

The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)

A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)

The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

Bound vertices of longest paths between two vertices in cubic graphs
by: Li, Chengli, et al.
Published: (2024)

Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
by: Li, Chengli, et al.
Published: (2025)

Characterizations of the graphs with dominating parameters
by: Ma, Yuhan
Published: (2024)

Chords of longest cycles in graphs with large circumferences
by: Wu, Haidong, et al.
Published: (2025)

A sufficient condition for pancyclic graphs
by: Zhan, Xingzhi
Published: (2024)

Chords of longest cycles passing through a specified small set
by: Wu, Haidong, et al.
Published: (2025)

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
by: Attwa, Yamaan, et al.
Published: (2026)

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

Counting $k$-cycles in $5$-connected planar triangulations
by: Agrahari, Gyaneshwar, et al.
Published: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Extending Thomassen's conjecture to directed graphs
by: Christoph, Micha, et al.
Published: (2025)

A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
by: Kostochka, Alexandr, et al.
Published: (2022)

Isolation of regular graphs and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

Proof of the linkage conjecture for highly connected tournaments
by: Zhou, Jia, et al.
Published: (2025)

Isolation of regular graphs, stars and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

On the $k$-linkage problem for generalizations of semicomplete digraphs
by: Zhou, Jia, et al.
Published: (2025)

Ore-type conditions for existence of a jellyfish in a graph
by: Kim, Jaehoon, et al.
Published: (2024)

Even cycles in graphs avoiding longer even cycles
by: Conlon, David, et al.
Published: (2025)

On saturation numbers of complete multipartite graphs and even cycles
by: Mohammadian, Ali, et al.
Published: (2025)

Turán number of the odd-ballooning of complete bipartite graphs
by: Peng, Xing, et al.
Published: (2023)

Size conditions for admissible or consecutive even cycles in graphs
by: Lin, Jifu
Published: (2026)

The number of edges in graphs with bounded clique number and circumference
by: Dou, Chunyang, et al.
Published: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

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

Turán-type and tiling problems in oriented graphs
by: Chen, Ming, et al.
Published: (2026)

A generalisation of Menger's theorem in bidirected graphs
by: Ghorbani, Ebrahim, et al.
Published: (2025)

Maximum values of the edge Mostar index in tricyclic graphs
by: Hayat, Fazal, et al.
Published: (2023)

Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)

The path minimises the average size of a connected induced subgraph
by: Haslegrave, John
Published: (2021)

Locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)

The minimum size of 2-connected chordal bipartite graphs
by: Zhang, Licheng, et al.
Published: (2024)