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

DOI10.1016/J.ENDM.2016.09.019zbMATH Open1356.05101OpenAlexW2538856437MaRDI QIDQ510552FDOQ510552

Authors: 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

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

zbMATH Keywords

connectivityindependence numberhighly connected subgraph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on Hamiltonian circuits
• Longest cycles in \(k\)-connected graphs with given independence number
• Title not available (Why is that?)
• 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
• Partitioning a graph into highly connected subgraphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs

Cited In (4)

• Highly connected subgraphs of graphs with given independence number
• On the stability of the graph independence number
• Isolating highly connected induced subgraphs
• Conditions for families of disjoint \(k\)-connected subgraphs in a graph

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)