On the equivalence covering number of splitgraphs
From MaRDI portal
Publication:673014
DOI10.1016/0020-0190(95)00037-DzbMATH Open0875.68456OpenAlexW2115487960MaRDI QIDQ673014FDOQ673014
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
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
- Title not available (Why is that?)
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Covering graphs by the minimum number of equivalence relations
- The NP-completeness column: an ongoing guide
- Title not available (Why is that?)
- Complexity of dimension three and some related edge-covering characteristics of graphs
- Clique covers and coloring problems of graphs
- Title not available (Why is that?)
- A Property of Infinite Products of Boolean Matrices
Cited In (7)
- A computational complexity comparative study of graph tessellation problems
- Dimension-free bounds and structural results in communication complexity
- Split dimension of graphs
- Covering graphs by the minimum number of equivalence relations
- The equivalence number of a line graph
- Covering line graphs with equivalence relations
- Title not available (Why is that?)
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)
