Clique covering the edges of a locally cobipartite graph (Q1567657)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1462314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique covering the edges of a locally cobipartite graph |
scientific article; zbMATH DE number 1462314 |
Statements
Clique covering the edges of a locally cobipartite graph (English)
0 references
21 June 2000
0 references
A graph is locally cobipartite if the vertices of the neighbourhood of any vertex can be covered by at most two cliques. The authors prove that a locally cobipartite graph on \(n\) vertices has a family of at most \(n\) cliques that cover its edges. This result supports Opsut's conjecture that the competition number of a locally cobipartite graph is at most \(2\).
0 references
clique cover
0 references
competition graph
0 references
locally cobipartite graph
0 references
competition number
0 references
0.7826136946678162
0 references
0.7709838151931763
0 references
0.763763964176178
0 references
0.7547937631607056
0 references
