Upper bounds on the edge clique cover number of a graph
From MaRDI portal
Publication:799696
Recommendations
Cites work
- scientific article; zbMATH DE number 3849229 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3627219 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- Cliques in random graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On clique covers and independence numbers of graphs
- Parallel concepts in graph theory
- The Representation of a Graph by Set Intersections
- Über ein Extremalproblem der Graphentheorie
Cited in
(14)- A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
- The asymptotic order of the abdiff-tolerance edge clique cover number of \(K_{2,n}\)
- scientific article; zbMATH DE number 109202 (Why is no real title available?)
- scientific article; zbMATH DE number 3843787 (Why is no real title available?)
- A new upper bound for the clique cover number with applications
- Edge clique covers in graphs with independence number two
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
- Covering arrays avoiding forbidden edges
- Edge-clique covers of the tensor product
- Edge-clique covers of the tensor product
- Edge clique covering sum of graphs
- Clique covering of graphs
- A property about minimum edge- and minimum clique-cover of a graph
- scientific article; zbMATH DE number 4139778 (Why is no real title available?)
This page was built for publication: Upper bounds on the edge clique cover number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799696)
