Image de couverture de livre

On the Edge-Connectivity of the Square of a Graph

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Balbuena, Camino, Dankelmann, Peter
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics 05C40
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph
par: Dankelmann, Peter
Publié: (2024)

On g-Extra Connectivity of Corona-Type Graph Products
par: Sharma, Arati, et autres
Publié: (2025)

On Proximity and other Distance Parameters in Planar Graphs
par: Dankelmann, Peter, et autres
Publié: (2025)

Proximity and Radius in Outerplanar Graphs with Bounded Faces
par: Dankelmann, Peter, et autres
Publié: (2025)

Rainbow Connection for Complete Multipartite Graphs
par: Araujo, Igor, et autres
Publié: (2022)

On the Connectivity of Friends-and-strangers Graphs
par: Krishnan, Neil, et autres
Publié: (2024)

Gallai-Ramsey Numbers for $\ell$-Connected Graphs
par: Wang, Zhao, et autres
Publié: (2026)

Connected equitably $Δ$-colorable realizations with $k$-factors
par: Shook, James M.
Publié: (2025)

Remoteness of graphs with given size and connectivity constraints
par: Dankelmann, Peter, et autres
Publié: (2024)

Counting Isomorphism Classes of Spanning Trees of Complete Bipartite Graphs
par: Johnson, Peter, et autres
Publié: (2026)

Splitter Theorems for Graph Immersions
par: DeVos, Matt, et autres
Publié: (2018)

Real Reliability Roots of Simple Graphs are Dense
par: Omar, Mohamed
Publié: (2026)

Generalized Token Graphs
par: Herrera-Ramirez, C. Amairani, et autres
Publié: (2025)

Canonical Decompositions of 3-Connected Graphs
par: Carmesin, Johannes, et autres
Publié: (2023)

Agile Sets in Graphs
par: Elbracht, Christian, et autres
Publié: (2021)

Edge-ends versus topological ends of graphs
par: Aurichi, Leandro, et autres
Publié: (2026)

Hamiltonian Complete Number of Some Variants of Caterpillar Graphs
par: Adefokun, Tayo Charles, et autres
Publié: (2022)

Twin-width of graphs with tree-structured decompositions
par: Heinrich, Irene, et autres
Publié: (2023)

The Locating Rainbow Connection Number of the Edge Corona of a Graph with a Complete Graph
par: Bustan, Ariestha Widyastuty, et autres
Publié: (2024)

The proof of a conjecture about cages
par: Pan, Xiang-Feng, et autres
Publié: (2024)

A degree sum condition for the existence of a quasi 5-contractible edge in a quasi 5-connected graph
par: Kou, Shuai, et autres
Publié: (2025)

On a conjecture that strengthens Kundu's $k$-factor Theorem
par: Shook, James M.
Publié: (2022)

Connectoids I: a universal end space theory
par: Bowler, Nathan, et autres
Publié: (2024)

The path minimises the average size of a connected induced subgraph
par: Haslegrave, John
Publié: (2021)

On fixing and distinguishing numbers of trees
par: Buchanan, Calum, et autres
Publié: (2026)

Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
par: Chudnovsky, Maria, et autres
Publié: (2026)

Bounds for Hypergraph Universality
par: Allen, Peter, et autres
Publié: (2025)

Restriction on minimum degree in the contractible sets problem
par: Karol, Nikolai
Publié: (2022)

A forbidden pair for quasi 5-contractible edges
par: Kou, Shuai, et autres
Publié: (2025)

A star-comb lemma for finite digraphs
par: Reich, Florian
Publié: (2024)

Connectoids II: existence of normal trees
par: Bowler, Nathan, et autres
Publié: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
par: Yuster, Raphael
Publié: (2024)

Diameter and connectivity of finite simple graphs II
par: Hibi, Takayuki, et autres
Publié: (2024)

A Note on Improved bounds for the Oriented Radius of Mixed Multigraphs
par: Li, Hengzhe, et autres
Publié: (2024)

On forest and bipartite cuts in sparse graphs
par: Bogdanov, Ilya I., et autres
Publié: (2025)

Stotting in positional games
par: Carmesin, Johannes, et autres
Publié: (2026)

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

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
par: Erde, Joshua, et autres
Publié: (2019)

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
par: Nguyen, Tung, et autres
Publié: (2025)

On order-compatible paths in infinite graphs
par: Pitz, Max, et autres
Publié: (2026)