New results on k-independence of graphs
From MaRDI portal
Publication:528993
zbMATH Open1361.05097MaRDI QIDQ528993FDOQ528993
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.)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New approach to the \(k\)-independence number of a graph
- On \(k\)-domination and \(j\)-independence in graphs
- Improved lower bounds on k‐independence
- 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 (10)
- Multiple Domination
- 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
- New results on \(k\)-independence of hypergraphs
- Improved lower bounds on k‐independence
- New results relating independence and matchings
- MAX for \(k\)-independence in multigraphs
- The k‐path vertex cover: General bounds and chordal graphs
Recommendations
- Title not available (Why is that?) 👍 👎
- A new lower bound on the independence number of graphs 👍 👎
- New approach to the \(k\)-independence number of a graph 👍 👎
- Independence andk-domination in graphs 👍 👎
- A new lower bound on the independence number of a graph and applications 👍 👎
- New bounds on the independence number of connected graphs 👍 👎
- New results on independent sets in extensions of \(2K_2\)-free graphs 👍 👎
- On the \(k\)-independence number of graphs 👍 👎
- New results on \(k\)-independence of hypergraphs 👍 👎
- On the \(k\)-independence number in 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)