scientific article; zbMATH DE number 786177

zbMath0829.05048MaRDI QIDQ4842756

Carol A. Whitehead

Publication date: 7 September 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

characterizationindependence numberclaw-free graphsline graphsmaximal independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ On 4-connected claw-free well-covered graphs ⋮ Exact sequences and closed model categories ⋮ Unnamed Item ⋮ A characterization of well-covered graphs in terms of forbidden costable subgraphs

This page was built for publication: