The quest for a characterization of hom-properties of finite character
From MaRDI portal
Publication:274710
DOI10.7151/DMGT.1873zbMath1338.05189OpenAlexW2333864747MaRDI QIDQ274710
Izak Broere, Moroli D. V. Matsoha, Johannes Heidema
Publication date: 25 April 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1873
connectednessindependence numbercorehomomorphismchromatic numberclique numberdominating setaxiomatizable propertycompactness theoremscountable graphfinitely determined propertyfinitely-induced hereditary propertyhom-propertyproperty of graphsweakly finite character
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cores and compactness of infinite directed graphs
- Color-families are dense
- Core-like properties of infinite graphs and structures
- Introduction to model theory and to the metamathematics of algebra
- On infinite uniquely partitionable graphs and graph properties of finite character
- On color-families of graphs
- A survey of hereditary properties of graphs
- List-compactness of infinite directed graphs
This page was built for publication: The quest for a characterization of hom-properties of finite character