Zobrazeno 1 - 10
of 31
pro vyhledávání: '"hereditary graph property"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 689-703 (2019)
A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Externí odkaz:
https://doaj.org/article/6e3fe3f398a346f697d7223b58def5dd
Autor:
Vladimir Samodivkin
Publikováno v:
Mathematica Bohemica, Vol 142, Iss 1, Pp 9-20 (2017)
For a graphical property $\mathcal{P}$ and a graph $G$, a subset $S$ of vertices of $G$ is a $\mathcal{P}$-set if the subgraph induced by $S$ has the property $\mathcal{P}$. The domination number with respect to the property $\mathcal{P}$, denoted by
Externí odkaz:
https://doaj.org/article/7bbea17377fa4798880bb92970302eff
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 689-703 (2019)
A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de5013226ad82e2d7da6ee0ab85d9598
https://doaj.org/article/6e3fe3f398a346f697d7223b58def5dd
https://doaj.org/article/6e3fe3f398a346f697d7223b58def5dd
Autor:
Pach, Janos, Sarioez, Deniz
The obstacle number of a graph G is the smallest number of polygonal obstacles in the plane with the property that the vertices of G can be represented by distinct points such that two of them see each other if and only if the corresponding vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a5b88d40e709b420d3c44f3da9bd7a9f
http://doc.rero.ch/record/316627/files/373_2011_Article_1027.pdf
http://doc.rero.ch/record/316627/files/373_2011_Article_1027.pdf
Publikováno v:
Quaestiones Mathematicae; Vol 40, No 4 (2017); 539-551
A graph property is any isomorphism-closed class of graphs. A property P is hereditary if, whenever a graph G is in P, and H is a subgraph of G, then H is also in P. For a hereditary graph property P, positive integer l and a graph G, let ′ ρP,l(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5051a99adc5cb9e3ffce8d91c7bf5a39
https://www.ajol.info/index.php/qm/article/view/158241
https://www.ajol.info/index.php/qm/article/view/158241
Autor:
Mihailović, Bojana Lj.
Publikováno v:
Универзитет у Београду
Predmet ove disertacije pripada oblasti spektralne teorije grafova, mladoj grani matematičke kombinatorike, odnosno teorije grafova, koja u današnje vreme nalazi važne primene u mnogim poljima, kao što su hemija, fizika, računarstvo, telekomunik
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=nardusnacion::e20fc29b1d42f9abcc9e1bd7f7c48f51
https://nardus.mpn.gov.rs/bitstream/id/6716/IzvestajKomisije8320.pdf
https://nardus.mpn.gov.rs/bitstream/id/6716/IzvestajKomisije8320.pdf
Autor:
Gabriel Semanišin, Peter Mihók
Publikováno v:
Discrete Mathematics. 307:958-963
The product P@?Q of graph properties P,Q is the class of all graphs having a vertex-partition into two parts inducing subgraphs with properties P and Q, respectively. For a graph invariant @f and a graph property P we define @f(P) as the minimum of @
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c514715497fb0371f8a950677946774
https://doi.org/10.1016/j.disc.2005.11.048
https://doi.org/10.1016/j.disc.2005.11.048