On the \(p\)-connectedness of graphs---a survey
From MaRDI portal
Publication:1302141
DOI10.1016/S0166-218X(99)00062-1zbMath0947.05079OpenAlexW2077462389MaRDI QIDQ1302141
Luitpold Babel, Stephan Olariu
Publication date: 12 December 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00062-1
partitiondecompositioncharacterizationsconnectivityreconstructionlinear-time algorithmsgraph classesgraph operations\(p\)-connectednessend vertices\(p\)-components\(p\)-connected graphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Connectivity (05C40)
Related Items (10)
A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs ⋮ On the \(b\)-coloring of \(P_{4}\)-tidy graphs ⋮ The maker-breaker largest connected subgraph game ⋮ On variations of \(P_{4}\)-sparse graphs ⋮ Stability number of bull- and chair-free graphs revisited ⋮ \(N\)-extendible posets, and how to minimize total weighted completion time ⋮ GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Recognizing the \(P_4\)-structure of bipartite graphs
This page was built for publication: On the \(p\)-connectedness of graphs---a survey
