A generalization of an ear decomposition and k-trees in highly connected star-free graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maezawa, Shun-ichi, Ozeki, Kenta, Yamamoto, Masaki, Yashima, Takamasa
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C05, 05C35, 05C40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
by: Enami, Kengo, et al.
Published: (2025)

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

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

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

Twin-width of graphs with tree-structured decompositions
by: Heinrich, Irene, et al.
Published: (2023)

On the extrema of the mean subtree order of graphs
by: Cambie, Stijn, et al.
Published: (2025)

Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)

Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

Odd coloring of $k$-trees
by: Kashima, Masaki, et al.
Published: (2025)

Canonical tree-decompositions of chordal graphs
by: Jacobs, Raphael W., et al.
Published: (2025)

On tree-decompositions for infinite chordal graphs
by: Pitz, Max, et al.
Published: (2026)

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

Bounding mean orders of sub-$k$-trees of $k$-trees
by: Cambie, Stijn, et al.
Published: (2023)

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

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

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

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

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

On forest and bipartite cuts in sparse graphs
by: Bogdanov, Ilya I., et al.
Published: (2025)

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

Linked tree-decompositions into finite parts
by: Albrechtsen, Sandra, et al.
Published: (2024)

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

How connectivity affects the extremal number of trees
by: Jiang, Suyun, et al.
Published: (2023)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025)

Decomposition of Cliques into $k$-Star-Forests
by: Nie, Jiaxi, et al.
Published: (2025)

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

Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024)

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
by: Liu, Jianxi
Published: (2026)

The sharp upper bounds on the maximum degree and vertex-connectivity of claw-free 1-planar graphs
by: Zhang, Licheng, et al.
Published: (2025)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
by: Polavarapu, Achintya Raya
Published: (2026)

The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)

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

On the most reliable graphs with fixed redundancy
by: Brand, Rotem, et al.
Published: (2026)

Hoffman-London graphs: When paths minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)