Imagen de Portada

Partitions of complete twisted graphs into plane spanning trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Figueroa, Ana Paulina, Rivera-Campo, Eduardo
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A note on maximal plane subgraphs of the complete twisted graph containing perfect matchings
por: Omaña-Pulido, Elsa, et al.
Publicado: (2025)

Maximum spanning trees in normed planes
por: Alonso, Javier, et al.
Publicado: (2026)

The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
por: Kúsz, Ágnes
Publicado: (2024)

Fan's condition for completely independent spanning trees
por: Ma, Jie, et al.
Publicado: (2025)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
por: Wang, Wei, et al.
Publicado: (2026)

On the size of universal graphs for spanning trees
por: Kim, Jaehoon, et al.
Publicado: (2025)

Discrepancies of spanning trees in dense graphs
por: Hollom, Lawrence, et al.
Publicado: (2024)

The enumeration of odd spanning trees in graphs
por: Xu, Shaohan, et al.
Publicado: (2026)

Almost colour-balanced spanning forests in complete graphs
por: Hollom, Lawrence, et al.
Publicado: (2024)

Semidegree threshold for spanning trees in oriented graphs
por: Araújo, Pedro, et al.
Publicado: (2026)

On the number of distinct spanning trees in pseudorandom graphs
por: Wang, Yiting
Publicado: (2026)

The Ferrers bound for spanning trees in bipartite graphs
por: Ho, Boon Suan
Publicado: (2026)

Local limit of massive spanning forests on the complete graph
por: D'Achille, Matteo, et al.
Publicado: (2024)

A complete $t$-intersection theorem for families of spanning trees
por: Iarovikova, Elizaveta, et al.
Publicado: (2025)

On the number of spanning trees in random regular graphs
por: Greenhill, Catherine, et al.
Publicado: (2013)

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices
por: Li, Dan, et al.
Publicado: (2024)

Bounded-degree spanning trees in randomly perturbed graphs
por: Krivelevich, Michael, et al.
Publicado: (2015)

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

Effective resistance and spanning trees in complete graphs with distance-class deletions
por: Tamura, Shunya
Publicado: (2026)

Random minimum spanning tree and dense graph limits
por: Hladký, Jan, et al.
Publicado: (2023)

Anticoncentration of random spanning trees in almost regular graphs
por: Lee, Hyunwoo
Publicado: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
por: Behrooznia, Nastaran, et al.
Publicado: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
por: Liu, Hechao, et al.
Publicado: (2025)

Odd spanning trees of a graph
por: Zheng, Jingyu, et al.
Publicado: (2025)

Geometric bounds for spanning tree entropy of planar lattice graphs
por: Champanerkar, Abhijit, et al.
Publicado: (2025)

A closure result on spanning $k$-trees of graphs with given minimum degree
por: Zhang, Wenqian
Publicado: (2026)

On the number of spanning trees of bicirculant graphs
por: Yang, Jing, et al.
Publicado: (2026)

What induces plane structures in complete graph drawings?
por: Weinberger, Alexandra, et al.
Publicado: (2026)

Random choice spanning trees
por: Archer, Eleanor, et al.
Publicado: (2024)

Number of spanning trees in a wheel graph with two identified vertices via hitting times
por: Tamura, Shunya, et al.
Publicado: (2025)

The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
por: Baker, Matthew, et al.
Publicado: (2025)

Spectral radius and homeomorphically irreducible spanning trees of graphs
por: Gao, Bingqian, et al.
Publicado: (2025)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

An exact-arithmetic algorithm for spanning tree modulus
por: Albin, Nathan, et al.
Publicado: (2020)

A short note on spanning even trees
por: Ai, Jiangdong, et al.
Publicado: (2024)

Construction of infinitely many trace-minimal graphs with maximum number of spanning trees
por: Romero, Pablo, et al.
Publicado: (2025)

Optimally building spanning graphs in semirandom graph processes
por: Anastos, Michael, et al.
Publicado: (2025)

Algorithmic releases on the spanning trees of suitable graphs
por: Imbesi, Maurizio, et al.
Publicado: (2017)

On the random minimum edge-disjoint spanning trees problem
por: Shabanov, Dmitry, et al.
Publicado: (2025)