| Autor: | Victor Neumann-Lara, Richard G. Wilson |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Vertex (graph theory)
Discrete mathematics Algebra and Number Theory Induced subgraph law.invention Combinatorics Computational Theory and Mathematics law Line graph Cograph Geometry and Topology Graph factorization MathematicsofComputing_DISCRETEMATHEMATICS Mathematics Universal graph Distance-hereditary graph Forbidden graph characterization |
| Zdroj: | Order. 15:35-50 |
| ISSN: | 0167-8094 |
| Popis: | A topology on the vertex set of a comparability graph G is said to be compatible (respectively, weakly compatible) with G if each induced subgraph (respectively, each finite induced subgraph) is topologically connected if and only it it is graph-connected; a weakly compatible topology on the vertex set of a graph completely determines the graph structure. We consider here the problem of deciding whether or not a comparability graph has a compact compatible or weakly compatible topology and in the case of graphs with small cycles, hence in the case of trees, we give a characterization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink