Highly connected subgraphs of graphs with given independence number

DOI10.1016/j.ejc.2018.01.004zbMath1384.05103OpenAlexW2792426560MaRDI QIDQ1746581

Xianqiang Yang

Publication date: 25 April 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.01.004

Mathematics Subject Classification ID

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

Related Items (3)

The optimal proper connection number of a graph with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ 2-proper partition of a graph

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 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
• Adding random edges to dense graphs

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