Zobrazeno 1 - 10
of 36
pro vyhledávání: '"induced-hereditary"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 893-917 (2020)
Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) co
Externí odkaz:
https://doaj.org/article/f59e5a0c03a3441484ed2fb32f110b67
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 2, Pp 323-349 (2018)
Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no mor
Externí odkaz:
https://doaj.org/article/9b8d94ffc9354ed18ae7953a0eab2035
Autor:
Drgas-Burchardt, Ewa, Drzystek, Agata
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2016 Oct 01. 10(2), 479-500.
Externí odkaz:
https://www.jstor.org/stable/applianadiscmath.10.2.479
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 479-500 (2016)
A graph property is a set of (countable) graphs. A homomorphism from a graph G to a graph H is an edge-preserving map from the vertex set of G into the vertex set of H; if such a map exists, we write G → H. Given any graph H, the hom-property →H
Externí odkaz:
https://doaj.org/article/7474df6e42a245c3bbf989d7ed4425f1
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 477-492 (2013)
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 < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R i
Externí odkaz:
https://doaj.org/article/ebf3bffa3d424f1782a5bd9f5a3a286f
Autor:
Broere Izak, Heidema Johannes
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 1, Pp 33-47 (2013)
The well-known Rado graph R is universal in the set of all countable graphs I, since every countable graph is an induced subgraph of R. We study universality in I and, using R, show the existence of 2 א0 pairwise non-isomorphic graphs which are univ
Externí odkaz:
https://doaj.org/article/0ae60690bb56457ba89ccddf7d93e424
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 893-917 (2020)
Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a36846a22f519d01478052ce207071b
https://doaj.org/article/f59e5a0c03a3441484ed2fb32f110b67
https://doaj.org/article/f59e5a0c03a3441484ed2fb32f110b67
Autor:
Gabriel Semanišin
Publikováno v:
Discrete Mathematics. 286(1-2):163-170
Let (M^a,@?) and (L^a,@?) be the lattices of additive induced-hereditary properties of graphs and additive hereditary properties of graphs, respectively. A property [email protected]?M^a (@?L^a) is called a minimal reducible bound for a property [ema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8201cc55482537326ea5550f3fe72ad9
Autor:
Danuta Michalak
Publikováno v:
Discrete Mathematics. 286(1-2):141-146
For a given graph G a subset X of vertices of G is called a dominating (irredundant) set with respect to additive induced-hereditary property P, if the subgraph induced by X has the property P and X is a dominating (an irredundant) set. A set S is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::282cde32c7e7d484e72eb839880518c0