A note on the saturation number of the family of \(k\)-connected graphs

DOI10.1016/j.disc.2014.01.007zbMath1283.05153OpenAlexW2009477307MaRDI QIDQ2439131

Paul S. Wenger

Publication date: 7 March 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.007

zbMATH Keywords

saturationsubgraph\(k\)-connected

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Weak saturation number of a complete bipartite graph ⋮ Extremal problems on saturation for the family of $k$-edge-connected graphs

Cites Work

• Unnamed Item
• A survey of minimum saturated graphs
• Forcing unbalanced complete bipartite minors
• An improved bound for the monochromatic cycle partition number
• Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
• Linear connectivity forces large complete bipartite minors
• On simple characterizations of k-trees
• Conditions for families of disjoint \(k\)-connected subgraphs in a graph
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Extremal connectivity for topological cliques in bipartite graphs
• A Problem in Graph Theory

This page was built for publication: A note on the saturation number of the family of \(k\)-connected graphs