Covering Graphs by Equivalence Relations

DOI10.1016/S0304-0208(08)73498-4MaRDI QIDQ3956997zbMATH OpenFDO

Authors Peter Frankl

Publication date 1982

Published in Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73498-4

zbMATH Keywords

complete graphequivalence relationshamiltonian cycle

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(2)

• Covering graphs by the minimum number of equivalence relations
• Dimension-free bounds and structural results in communication complexity

This page was built for publication: Covering Graphs by Equivalence Relations

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