Graphs with given k-independence number
From MaRDI portal
Publication:4566360
Recommendations
Cited in
(16)- The \(k\)-independent graph of a graph
- The \(k\)-independence number of graph products
- Graffiti.pc on the \(k\)-independence
- On \(k\)-independence in graphs with emphasis on trees
- scientific article; zbMATH DE number 3882467 (Why is no real title available?)
- The \(k\)-independence number of \(t\)-connected graphs
- scientific article; zbMATH DE number 3752895 (Why is no real title available?)
- Further results on the \(j\)-independence number of graphs
- New approach to the \(k\)-independence number of a graph
- Maximal k-independent sets in graphs
- A characterization of trees for a new lower bound on the \(k\)-independence number
- On the \(k\)-independence number in graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Some results on the independence number of circulant graphs \(C(n; \{1,k\})\)
- Admissible property of graphs in terms of independence number
- MAX for \(k\)-independence in multigraphs
This page was built for publication: Graphs with given \(k\)-independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566360)