Title of article
On constructible graphs, infinite bridged graphs and weakly cop-win graphs Original Research Article
Author/Authors
Marc Chastand، نويسنده , , François Laviolette، نويسنده , , Norbert Polat، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
18
From page
61
To page
78
Abstract
A (finite or infinite) graph G is constructible if there exists a well-ordering ⩽ of its vertices such that, for every vertex x which is not the smallest element, there is a vertex y
Keywords
Constructible graph , Dismantlable graph , Infinite graph , Bridged graph , Weakly cop-win graph , Dually compact closed class , Helly graph
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950577
Link To Document