Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Constructing universal graphs for induced-hereditary graph properties

In: Mathematica Slovaca, vol. 63, no. 2
Izak Broere - Johannes Heidema - Peter Mihók
Detaily:
Rok, strany: 2013, 191 - 200
Kľúčové slová:
countable graph, universal graph, induced-hereditary property, product of properties
O článku:
Rado constructed a (simple) denumerable graph $R$ with the positive integers as vertex set with the following edges: For given $m$ and $n$ with $m
Ako citovať:
ISO 690:
Broere, I., Heidema, J., Mihók, P. 2013. Constructing universal graphs for induced-hereditary graph properties. In Mathematica Slovaca, vol. 63, no.2, pp. 191-200. 0139-9918. DOI: https://doi.org/10.2478/s12175-012-0092-z

APA:
Broere, I., Heidema, J., Mihók, P. (2013). Constructing universal graphs for induced-hereditary graph properties. Mathematica Slovaca, 63(2), 191-200. 0139-9918. DOI: https://doi.org/10.2478/s12175-012-0092-z
O vydaní:
Publikované: 1. 4. 2013