On a problem of Harary

MaRDI QIDQ721094zbMATHFDO

Authors Paul C. Kainen

Publication date 18 July 2018

Published in Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.mjms/1513306832

zbMATH Keywords

edge coververtex coverindependence numbertriangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Covering number product bounds size
• Maximal independent sets in bipartite graphs
• Publication:3758861
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Independent and vertex covering number on strong product of complete bipartite graphs

Cited in

(2)

• Covering number product bounds size
• On a problem of Hendry

This page was built for publication: On a problem of Harary

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