New results on \(k\)-independence of graphs

zbMath1361.05097MaRDI QIDQ528993

Shimon Kogan

Publication date: 18 May 2017

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p15

zbMATH Keywords

\(k\)-independent set

Mathematics Subject Classification ID

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

Related Items

Mixed domination and 2-independence in trees ⋮ The k‐path vertex cover: General bounds and chordal graphs ⋮ New results on \(k\)-independence of hypergraphs ⋮ Multiple Domination ⋮ MAX for \(k\)-independence in multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a division property of consecutive integers
• Domination number in graphs with minimum degree two
• New approach to the \(k\)-independence number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• Partitions of graphs into small and large sets
• Improved lower bounds on k‐independence
• Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
• Paths, Stars and the Number Three