Cycles in graphs with prescribed stability number and connectivity

DOI10.1006/JCTB.1994.1023zbMath0805.05045OpenAlexW2071598117MaRDI QIDQ1322027

Mekkia Kouider

Publication date: 5 May 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1023

zbMATH Keywords

cyclesstability numberconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (15)

Spanning trees with bounded degrees and leaves ⋮ Large degree vertices in longest cycles of graphs. I ⋮ Circumferences of k-connected graphs involving independence numbers ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ Independence number and \(k\)-trees of graphs ⋮ Longest cycles in \(k\)-connected graphs with given independence number ⋮ A note on the independence number, connectivity and \(k\)-ended tree ⋮ The Chvátal-Erdős condition for a graph to have a spanning trail ⋮ A degree sum condition for graphs to be covered by two cycles ⋮ On 3-stable number conditions in \(n\)-connected claw-free graphs ⋮ Covering the vertices of a graph with cycles of bounded length ⋮ On pseudo 2-factors ⋮ Long cycles in triangle-free graphs with prescribed independence number and connectivity ⋮ Longest cycles in 3-connected graphs with given independence number

This page was built for publication: Cycles in graphs with prescribed stability number and connectivity