Multiple vertex coverings by specified induced subgraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200006)34:2<180::AID-JGT7>3.0.CO;2-L" /><180::AID-JGT7>3.0.CO;2-L 10.1002/1097-0118(200006)34:2<180::AID-JGT7>3.0.CO;2-LzbMath0955.05083arXivmath/9912188OpenAlexW2951284132MaRDI QIDQ4489493

Douglas B. West, Dhruv Mubayi, Zoltan Fueredi

Publication date: 18 February 2001

Full work available at URL: https://arxiv.org/abs/math/9912188

zbMATH Keywords

independent setcoveringscliquefull graphsframing numbers

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 (2)

Stars and triangles ⋮ Unnamed Item

Cites Work

• On cliques and bicliques

This page was built for publication: Multiple vertex coverings by specified induced subgraphs