Highly connected subgraphs of graphs with given independence number
type: Item
instance of: scholarly article
title: Highly connected subgraphs of graphs with given independence number
zbMATH Open document ID: 1384.05103
author: Xianqiang Yang
published in: European Journal of Combinatorics
publication date: 2018-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6864509
MaRDI profile type: Publication
full work available at URL: j.ejc.2018.01.004
OpenAlex ID: W2792426560
cites work: Adding random edges to dense graphs
cites work: Q4398864
cites work: Highly connected monochromatic subgraphs
cites work: Partitioning a Graph into Highly Connected Subgraphs
cites work: A note on Hamiltonian circuits
cites work: Q4715442
cites work: Note on highly connected monochromatic subgraphs in 2-colored complete graphs
cites work: Highly connected monochromatic subgraphs of multicolored graphs
cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
cites work: Longest cycles in \(k\)-connected graphs with given independence number
DOI: 10.1016/J.EJC.2018.01.004
description: scientific article; zbMATH DE number 6864509