scientific article; zbMATH DE number 4139778
From MaRDI portal
Publication:3472129
zbMATH Open0696.05030MaRDI QIDQ3472129FDOQ3472129
Authors: Robert Brigham, Ronald D. Dutton 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 975360
- scientific article; zbMATH DE number 7310192
- scientific article; zbMATH DE number 617588
- scientific article; zbMATH DE number 975413
- scientific article; zbMATH DE number 7300407
- scientific article; zbMATH DE number 4139777
- Upper bounds on the edge clique cover number of a graph
- Clique coverings of the edges of a random graph
- Edge clique covers in graphs with independence number two
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (7)
- The asymptotic order of the abdiff-tolerance edge clique cover number of \(K_{2,n}\)
- Extremal graphs domination insensitive to the removal of \(k\) edges
- Changing and unchanging of the radius of a graph
- Graphs whose vertex independence number is unaffected by single edge addition or deletion
- Covering arrays avoiding forbidden edges
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472129)
