Long path lemma concerning connectivity and independence number

zbMATH Open1226.05137MaRDI QIDQ554003

Colton Magnant, Shinya Fujita, Alexander Halperin

Publication date: 29 July 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/232906

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Independent sets which meet all longest paths ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets

This page was built for publication: Long path lemma concerning connectivity and independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554003)