|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 14 of 32 found articles
| Title: |
PERFECTLY ORDERABLE GRAPHS AND UNIQUE COLORABILITY |
| Author: |
Gábor Bacsó |
| Appeared in: |
Applicable analysis and discrete mathematics |
| Paging: | Volume 1 (2007) nr. 2 pages 415-419 |
| Year: |
2007 |
| Contents: |
Given a linear order $<$ on the vertices of a graph, an {itobstruction} is an induced $P_4$ $abcd$ such that $a < b$ and $d < c$. Alinear order without any obstruction is called {it perfect}. Agraph is {it perfectly orderable} if its vertex set has someperfect order. In the graph $G$, for two vertices $x$ and $y$, $x${it clique-dominates} $y$ if every maximum size clique containing$y$, contains $x$ too. We prove the following result: {it If aperfectly orderable graph is clique-pair-free then it contains twovertices such that one of them clique-dominates the other one. |
| Publisher: |
University of Belgrade and Academic Mind |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 14 of 32 found articles
| << previous | next >> |