scientific article; zbMATH DE number 903282

MaRDI QIDQ4885186zbMATH OpenFDO

Authors János Pach, Géza Tóth

Publication date 15 July 1996

zbMATH Keywords

coin graphindependence numberindependent set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• On the coefficients of the independence polynomial of graphs
• scientific article; zbMATH DE number 1557817
• On the \(k\)-independence number of graphs
• On the k-independence number in graphs
• On the independence number of random graphs
• Counting independent sets in cocomparability graphs
• On the Strength and Independence Number of Graphs
• Independence and matching number of some graphs
• On the number of independent sets in graphs with fixed independence number
• Independence and matching numbers of some token graphs

Cited in

(9)

• On the independence number of minimum distance graphs
• Independence numbers of planar contact graphs
• Discrete harmonic functions on infinite penny graphs
• A farewell to Ricky Pollack
• A note on the maximum number of edges of nonflowerable coin graphs
• Disjoint empty disks supported by a point set
• Computational Science and Its Applications – ICCSA 2004
• Harmonic functions of polynomial growth on infinite penny graphs
• General penny graphs are at most \(\frac{43}{18}\)-dense

This page was built for publication:

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