On the Structure of a k-Connected Graph (original) (raw)
Related papers
Introduction to kkk-independent graph of a graph
2015
K-Independence Stable Graphs Upon Edge Removal
Discussiones Mathematicae Graph Theory, 2010
Contraction and deletion blockers for perfect graphs and H-free graphs
Theoretical Computer Science
On the Complexity of Singly Connected Vertex Deletion
Lecture Notes in Computer Science, 2020
On Bounded-Degree Vertex Deletion parameterized by treewidth
Rolf Niedermeier, Robert Bredereck
Discrete Applied Mathematics, 2012
On the structure of k-connected graphs without Kk-minor
European Journal of Combinatorics, 2005
Discussiones Mathematicae Graph Theory, 2020
On Sufficient Degree Conditions for a Graph to be kkk-linked
Combinatorics, Probability and Computing, 2006
Canadian Journal of Mathematics, 1970
THE k-INDEPENDENT GRAPH OF A GRAPH
Advances and Applications in Discrete Mathematics, 2017
Recognizing connectedness from vertex-deleted subgraphs
Journal of Graph Theory, 2011
Reconstructing graphs from their k-edge deleted subgraphs
Journal of Combinatorial Theory, Series B, 1987
On the k-residue of disjoint unions of graphs with applications to k-independence
2014
Vertex (n, k)-choosability of graphs
2020
Discrete Optimization, 2019
On deletions of largest bonds in graphs
Haidong Wu, Bing Wei, Laura Sheppardson
Discrete Mathematics, 2008
A hierarchy of dismantlings in graphs
Discrete Mathematics
Contractible Small Subgraphs in k-connected Graphs
Graphs and Combinatorics, 2010
Some forbidden subgraph conditions for a graph to have a k-contractible edge
Discrete Mathematics, 2003
On connected k-domination in graphs
arXiv: Combinatorics, 2019
On the Parameterized Complexity of Simultaneous Deletion Problems
2017
On connectivity of the semi-splitting block graph of a graph
Acta Universitatis Sapientiae, Informatica
1 M ar 2 01 8 Strong Subgraph k-connectivity
2018
Graph Compositions: Deleting Edges from Complete Graphs
Integers
# a 35 Integers 15 ( 2015 ) Graph Compositions : Deleting Edges from Complete Graphs
2015
Fully Indecomposable and Nearly Decomposable Graphs
2017
On k-strong and k-cyclic digraphs
Discrete Mathematics, 1996
1 2 Fe b 20 19 k-dismantlability in graphs
2019
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs
ArXiv, 2021
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
Lecture Notes in Computer Science, 2016
Edge-connectivity in Pk-path graphs
2004
König Deletion Sets and Vertex Covers above the Matching Size
Lecture Notes in Computer Science, 2008
On decomposing a hypergraph into k connected sub-hypergraphs
Discrete Applied Mathematics, 2003