On the equivalence covering number of splitgraphs

DOI10.1016/0020-0190(95)00037-DMaRDI QIDQ673014zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On graphs with equal domination and covering numbers
• scientific article; zbMATH DE number 1522332
• Graphs with equal domination and covering numbers
• Covering graphs by the minimum number of equivalence relations
• Characterization of graphs with equal domination and covering number
• scientific article; zbMATH DE number 1237933
• Equicovering subgraphs of graphs and hypergraphs
• The splitting number of complete bipartite graphs
• scientific article; zbMATH DE number 175738
• Proof of a conjecture on the complete split-like graphs

Cites work

• scientific article; zbMATH DE number 4134090 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4164920 (Why is no real title available?)
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• A Property of Infinite Products of Boolean Matrices
• Clique covers and coloring problems of graphs
• Complexity of dimension three and some related edge-covering characteristics of graphs
• Covering graphs by the minimum number of equivalence relations
• The NP-Completeness of Edge-Coloring
• The NP-completeness column: an ongoing guide

Cited in

(7)

• A computational complexity comparative study of graph tessellation problems
• scientific article; zbMATH DE number 1138041 (Why is no real title available?)
• Covering line graphs with equivalence relations
• The equivalence number of a line graph
• Split dimension of graphs
• Covering graphs by the minimum number of equivalence relations
• Dimension-free bounds and structural results in communication complexity

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

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