Two families of graphs that are not CCE-orientable. (Q2715996)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two families of graphs that are not CCE-orientable. |
scientific article; zbMATH DE number 1600965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two families of graphs that are not CCE-orientable. |
scientific article; zbMATH DE number 1600965 |
Statements
20 July 2005
0 references
competition graph
0 references
CCE-graphs
0 references
CCE-orientable graphs
0 references
Two families of graphs that are not CCE-orientable. (English)
0 references
A graph \(G\) is called CCE-orientable if there is an orientation \(F\) of \(G\) so that whenever \((w,u)\), \((w,v)\), \((u,x)\), \((v,x)\) are in \(F\), either \((u,v)\) or \((v,u)\) is in \(F\). The paper presents two families of not CCE-orientable graphs and one of CCE-orientable graphs.
0 references
