On cliques and bicliques

DOI<60::AID-JGT6>3.0.CO;2-I 10.1002/(SICI)1097-0118(200005)34:1<60::AID-JGT6>3.0.CO;2-IzbMath0955.05084OpenAlexW4236509604MaRDI QIDQ4487075

Michael A. Henning

Publication date: 18 February 2001

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1<60::aid-jgt6>3.0.co;2-i

zbMATH Keywords

coveringscliqueframing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Multiple vertex coverings by specified induced subgraphs

Cites Work

• Unnamed Item
• Homogeneous embeddings of cycles in graphs
• WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH?
• SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH
• A note on cliques and independent sets

This page was built for publication: On cliques and bicliques