New results on k-independence of graphs

zbMATH Open1361.05097MaRDI QIDQ528993FDOQ528993

Authors: 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

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

Recommendations

• New results on \(k\)-independence of hypergraphs
• New approach to the \(k\)-independence number of a graph
• New bounds on the independence number of connected graphs
• On the \(k\)-independence number of graphs
• On the \(k\)-independence number in graphs
• A new lower bound on the independence number of graphs
• New results on independent sets in extensions of \(2K_2\)-free graphs
• scientific article; zbMATH DE number 1112370
• Independence and \(k\)-domination in graphs
• A new lower bound on the independence number of a graph and applications

zbMATH Keywords

\(k\)-independent set

Mathematics Subject Classification ID

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

Cites Work

• New approach to the \(k\)-independence number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Improved lower bounds on k‐independence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination number in graphs with minimum degree two
• Paths, Stars and the Number Three
• On a division property of consecutive integers
• Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
• Partitions of graphs into small and large sets

Cited In (16)

• On Turan's theorem for sparse graphs
• Graphs with given \(k\)-independence number
• Mixed domination and 2-independence in trees
• Complexity results on \(k\)-independence in some graph products
• A new notion of vertex independence and rank for finite graphs
• New results on independent sets in extensions of \(2K_2\)-free graphs
• Independence in connected graphs
• New approach to the \(k\)-independence number of a graph
• Independence number of hypergraphs under degree conditions
• New results on \(k\)-independence of hypergraphs
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
• Improved lower bounds on k‐independence
• New results relating independence and matchings
• Multiple domination
• MAX for \(k\)-independence in multigraphs
• The k‐path vertex cover: General bounds and chordal graphs

This page was built for publication: New results on \(k\)-independence of graphs

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