Highly connected subgraphs of graphs with given independence number (extended abstract)

DOI10.1016/j.endm.2016.09.019zbMath1356.05101OpenAlexW2538856437MaRDI QIDQ510552

Yong-Cai Geng, Sumit K. Garg

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.019

zbMATH Keywords

independence numberconnectivityhighly connected subgraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• Longest cycles in \(k\)-connected graphs with given independence number
• Highly connected subgraphs of graphs with given independence number
• Highly connected monochromatic subgraphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• A note on Hamiltonian circuits
• Partitioning a Graph into Highly Connected Subgraphs
• Highly connected monochromatic subgraphs of multicolored graphs

This page was built for publication: Highly connected subgraphs of graphs with given independence number (extended abstract)