Highly connected subgraphs of graphs with given independence number (extended abstract)
From MaRDI portal
(Redirected from Publication:510552)
Recommendations
- Highly connected subgraphs of graphs with given independence number
- Isolating highly connected induced subgraphs
- scientific article; zbMATH DE number 2191994
- Independence number and \(k\)-trees of graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
Cites work
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 945671 (Why is no real title available?)
- A note on Hamiltonian circuits
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Highly connected monochromatic subgraphs
- Highly connected monochromatic subgraphs of multicolored graphs
- Highly connected subgraphs of graphs with given independence number
- Longest cycles in \(k\)-connected graphs with given independence number
- Note on highly connected monochromatic subgraphs in 2-colored complete graphs
- Partitioning a graph into highly connected subgraphs
Cited in
(5)- Conditions for families of disjoint \(k\)-connected subgraphs in a graph
- Highly connected subgraphs of graphs with given independence number
- On the stability of the graph independence number
- Isolating highly connected induced subgraphs
- Highly connected graphs have highly connected spanning bipartite subgraphs
This page was built for publication: Highly connected subgraphs of graphs with given independence number (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510552)
