On the equivalence covering number of splitgraphs

DOI10.1016/0020-0190(95)00037-DzbMath0875.68456OpenAlexW2115487960MaRDI QIDQ673014

Aart Blokhuis, Ton Kloks

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00037-d

zbMATH Keywords

AlgorithmsGraph algorithmsEquivalence coveringSplitgraphs

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

Covering line graphs with equivalence relations ⋮ Dimension-free bounds and structural results in communication complexity ⋮ A computational complexity comparative study of graph tessellation problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering graphs by the minimum number of equivalence relations
• Complexity of dimension three and some related edge-covering characteristics of graphs
• Clique covers and coloring problems of graphs
• The NP-completeness column: an ongoing guide
• The NP-Completeness of Edge-Coloring
• A Property of Infinite Products of Boolean Matrices

This page was built for publication: On the equivalence covering number of splitgraphs