k-Independence and thek-residue of a graph

DOI<241::AID-JGT4>3.0.CO;2-S 10.1002/(SICI)1097-0118(199911)32:3<241::AID-JGT4>3.0.CO;2-SzbMath0936.05072OpenAlexW4229528707MaRDI QIDQ4718734

F. Jelen

Publication date: 18 May 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199911)32:3<241::aid-jgt4>3.0.co;2-s

zbMATH Keywords

degree sequencenumerical invariants\(k\)-independent set\(k\)-residue\(k\)-independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (6)

On \(k\)-independence in graphs with emphasis on trees ⋮ Graphs with the strong Havel-Hakimi property ⋮ Partitions of graphs into small and large sets ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Independent sets in bounded-degree hypergraphs ⋮ MAX for \(k\)-independence in multigraphs

This page was built for publication: k-Independence and thek-residue of a graph