Catálogo de publicaciones - libros
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
Fedor V. Fomin (eds.)
En conferencia: 32º International Workshop on Graph-Theoretic Concepts in Computer Science (WG) . Bergen, Norway . June 22, 2006 - June 24, 2006
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computer Graphics; Algorithms
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2006 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-48381-6
ISBN electrónico
978-3-540-48382-3
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2006
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2006
Cobertura temática
Tabla de contenidos
doi: 10.1007/11917496_31
Circular-Perfect Concave-Round Graphs
Sylvain Coulonges
For 1≤≤–, denotes the graph with vertices 0,1,...,–1, in which is adjacent to if and only if ≤|–|≤–. A graph is circular-perfect if, for every induced subgraph of , the infinum / for which admits a homomorphism to is equal to the supremum / for which admits a homomorphism to . We answer a question af Bang-Jensen and Huang by giving a complete characterization of circular-perfect concave-round graphs.
Pp. 348-355