Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract)
References (11)
- et al.
Highly connected monochromatic subgraphs
Discrete Math.
(2008) - et al.
A note on Hamiltonian circuits
Discrete Math.
(1972) - et al.
Longest cycles in k-connected graphs with given independence number
J. Combin. Theory Ser. B
(2011) Modern Graph Theory
(1998)- et al.
Partitioning a graph into highly connected subgraphs
J. Graph Theory
(2016)
There are more references available in the full text version of this article.
Cited by (1)
© 2016 Elsevier B.V. All rights reserved.