Title of article
Clique covering the edges of a locally cobipartite graph Original Research Article
Author/Authors
Guantao Chen، نويسنده , , Michael S. Jacobson، نويسنده , , André E. Kézdy، نويسنده , , Jen? Lehel، نويسنده , , Edward R. Scheinerman، نويسنده , , Chi Wang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
10
From page
17
To page
26
Abstract
We prove that a locally cobipartite graph on n vertices contains a family of at most n cliques that cover its edges. This is related to Opsutʹs conjecture that states the competition number of a locally cobipartite graph is at most two.
Keywords
Cobipartite graph , Competition graph , Edge clique cover , Opsutיs conjecture , Claw free
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950458
Link To Document