scientific article; zbMATH DE number 837049
From MaRDI portal
Publication:4862104
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<21::AID-JGT3>3.0.CO;2-O" /><21::AID-JGT3>3.0.CO;2-O 10.1002/(SICI)1097-0118(199601)21:1<21::AID-JGT3>3.0.CO;2-OzbMath0840.05034MaRDI QIDQ4862104
Noga Alon, Donovan R. Hare, Michael R. Fellows
Publication date: 27 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular graphstransversaldominating setNP-completevertex partitionpartition domination numberquadratic grid
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
A short proof that the list packing number of any graph is well defined ⋮ On upper bounds for the independent transversal domination number ⋮ Packing list‐colorings
This page was built for publication:
