Graffiti.pc on the k-independence

MaRDI QIDQ2869397zbMATH OpenFDO

Authors Ermelinda DeLaViña, Ryan Pepper

Publication date 3 January 2014

Published in Congressus Numerantium (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Graffiti.pc on the independent-domination number of a graph
• scientific article; zbMATH DE number 4041962
• Graphs with given \(k\)-independence number
• scientific article; zbMATH DE number 5037210
• scientific article; zbMATH DE number 5919758

Cited in

(7)

• scientific article; zbMATH DE number 4103106 (Why is no real title available?)
• scientific article; zbMATH DE number 2170329 (Why is no real title available?)
• Graffiti.pc on the independent-domination number of a graph
• scientific article; zbMATH DE number 5037208 (Why is no real title available?)
• Upper bounds on the \(k\)-forcing number of a graph
• scientific article; zbMATH DE number 5919758 (Why is no real title available?)
• On new didactics of mathematics: learning graph theory via Graffiti

This page was built for publication: Graffiti.pc on the \(k\)-independence

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