Graffiti.pc on the k-independence

zbMATH Open1278.05170MaRDI QIDQ2869397FDOQ2869397

Authors: Ermelinda DeLaViña, Ryan Pepper 

Publication date: 3 January 2014

Published in: Congressus Numerantium (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graffiti.pc on the independent-domination number of a graph
• Title not available (Why is that?)
• Upper bounds on the \(k\)-forcing number of a graph
• Title not available (Why is that?)
• 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)