PERS - System Informacji o Pracownikach

SKEP - Wyniki wyszukiwania wśród publikacji

Szukanie:
w opisie bibliograficznym
Wprowadzona fraza:
{Discrete Mathematics}
Opublikowano w latach:
1960 - 2023
Znaleziono:
51 (spośród około 72877)
26.
Hereditarily dominated graphs, 2007, Danuta Michalak , Discrete Mathematics, Vol. 307, no 7-8, 952--957, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: dominating set, dominating subgraph, induced forbidden subgraph
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 1 [06-05-2024]
[AWCZ-12065] [data modyf. 06-04-2021 13:59]
27.
Pattern avoidance on graphs, 2007, Jarosław Grytczuk , Discrete Mathematics, Vol. 307, iss. 11-12, 1341--1346, ISSN: 0012-365X, bibliogr. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 17 [06-05-2024]
[AWCZ-12217] [data modyf. 06-04-2021 13:59]
28.
On chromaticity of hypergraphs, 2007, Mieczysław Borowiecki , Ewa Łazuka , Discrete Mathematics, Vol. 307, no 11-12, 1418--1429, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: chromatic polynomial, chromatically characterized hypergraphs, uniform hypertrees, uniform unicyclic hypergraphs
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 7 [06-05-2024]
[AWCZ-12049] [data modyf. 06-04-2021 13:59]
29.
Nonrepetitive colorings of trees, 2007, B. Brešar , Jarosław Grytczuk , S. Klavžar , Stanisław Niwczyk , I. Peterin , Discrete Mathematics, Vol. 307, no 2, 163--172, ISSN: 0012-365X, bibliogr. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 37 [06-05-2024]
[AWCZ-11567] [data modyf. 06-04-2021 13:59]
30.
Marking games, 2006, Elżbieta Sidorowicz , Electronic Notes in Discrete Mathematics, Vol. 24, 211--214, bibliogr. summ. - <a href="http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description">http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description</a>, [dostęp: 08-01-2007]
Słowa kluczowe: game colouring number, hereditary property, marking game
Kod: CZR-INNE BibTeX (pkt. 0)
Cytowania wg Scopus: 0 [06-05-2024]
[AWCZ-11305] [data modyf. 06-04-2021 13:58]
31.
List coloring of Cartesian products of graphs, 2006, Mieczysław Borowiecki , Stanislav Jendrol , Daniel Král , Jozef Miškuf , Discrete Mathematics, Vol. 306, no 16, 1955--1958, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: Cartesian product of graph, Graph coloring, List coloring, Products of graph
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 10 [06-05-2024]
[AWCZ-11291] [data modyf. 06-04-2021 13:59]
32.
On the number of minimal partitions of a box into boxes, 2006, Andrzej Kisielewicz , Krzysztof Przesławski , Discrete Mathematics, Vol. 306, no 8-9, 843--846, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: box, minimal partitions, orbit, stabilizer
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 1 [06-05-2024]
[AWCZ-11365] [data modyf. 06-04-2021 13:59]
33.
On k-chromatically unique and k-chromatically equivalent hypergraphs, 2006, Ewa Drgas-Burchardt , Electronic Notes in Discrete Mathematics, Vol. 24, 57--60, bibliogr. summ. - <a href="http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description">http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description/</a>, [dostęp: 25-10-2006]
Słowa kluczowe: chromatic polynomials of hypergraphs, chromatically equivalence, colourings of hypergraphs
Kod: CZR-INNE BibTeX (pkt. 0)
Cytowania wg Scopus: 0 [06-05-2024]
[AWCZ-11183] [data modyf. 06-04-2021 13:59]
34.
On chromatic polynomials of hypergraphs, 2006, Ewa Drgas-Burchardt , Ewa Łazuka , Electronic Notes in Discrete Mathematics, Vol. 24, 105--110, bibliogr. summ. - <a href="http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description">http://www.elsevier.com/wps/find/journaldescription.cws_home/681020/description#description</a>, [dostęp: 25-10-2006]
Słowa kluczowe: chromatic polynomials of hypergraphs, colourings of hypergraphs
Kod: CZR-INNE BibTeX (pkt. 0)
Cytowania wg Scopus: 0 [06-05-2024]
[AWCZ-11184] [data modyf. 06-04-2021 13:58]
35. The game of arboricity, 2005, Tomasz Bartnicki , Jarosław Grytczuk , Hal A. Kierstead , W: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB 2005, Berlin, Niemcy, Nancy: [brak wydawcy], 2005, Discrete Mathematics and Theoretical Computer Science : Proceedings Series Volume AE, s. 63--66 [abstr.],
Kod: ROZ-5 BibTeX (pkt. 0)
[KONF-18130] [data modyf. 06-04-2021 13:59]
36.
Minimal vertex Ramsey graphs and minimal forbidden subgraphs, 2004, Marta Borowiecka-Olszewska , Ewa Drgas-Burchardt , Peter Mihok , Discrete Mathematics, Vol. 286, no 1-2, 31--36, ISSN: 0012-365X, bibliogr. rys.
Słowa kluczowe: generalized vertex colouring, hereditary properties and minimal forbidden subgraphs, vertex Ramsey minimal graphs
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 4 [06-05-2024]
[AWCZ-9686] [data modyf. 06-04-2021 13:59]
37.
Another variation on Conway's recursive sequence, 2004, Jarosław Grytczuk , Discrete Mathematics, Vol. 282, 149--161, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: Conway's recursive sequence, Pascal triangle, guided sparse substitution, strange recurrence
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 3 [06-05-2024]
[AWCZ-9933] [data modyf. 06-04-2021 13:59]
38.
On Ramsey minimal graphs, 2004, Mieczysław Borowiecki , Mariusz Hałuszczak , Elżbieta Sidorowicz , Discrete Mathematics, Vol. 286, no 1-2, 37--43, ISSN: 0012-365X, bibliogr.
Słowa kluczowe: Ramsey-minimal graphs and 1-factor
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 13 [06-05-2024]
[AWCZ-9685] [data modyf. 06-04-2021 13:59]
39.
Domination, independence and irredundance with respect to additive induced-hereditary properties, 2004, Danuta Michalak , Discrete Mathematics, Vol. 286, no 1-2, 141--146, ISSN: 0012-365X, bibliogr. rys.
Słowa kluczowe: domination number, hereditary property and induced-hereditary property, independence number, irredundance number
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 6 [06-05-2024]
[AWCZ-9684] [data modyf. 06-04-2021 13:58]
40.
Haft-integrality of vertices of the generalized transitive tournament polytope (n=6), 2003, Zbigniew Świtalski , Discrete Mathematics, Vol. 271, no 1-3, 252--260, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: GTT matrices, GTT polytopes, comparability graphs, generalized transitive tournament, vertices of the GTTpolytopes
Kod: CZR-JCR BibTeX (pkt. 15)
[AWCZ-10678] [data modyf. 06-04-2021 13:59]
41.
Non-repetitive colorings of infinite sets, 2003, Jarosław Grytczuk , Wiesław Śliwa , Discrete Mathematics, Vol. 265, 365--373, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: non-repetitive colorings, thue sequences
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 11 [06-05-2024]
[AWCZ-8935] [data modyf. 07-04-2021 07:29]
42.
Some extremal problems of graphs with local constraints, 2002, Mieczysław Borowiecki , Elżbieta Sidorowicz , Discrete Mathematics, Vol. 251, 19--32, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: extremal problems, graph, hereditary property, local property
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 1 [06-05-2024]
[AWCZ-8695] [data modyf. 06-04-2021 13:59]
43.
On graphs with a local hereditary property, 2001, Mieczysław Borowiecki , Peter Mihok , Discrete Mathematics, no 236, 53--58, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: hereditary property, local property
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 2 [06-05-2024]
[AWCZ-7469] [data modyf. 06-04-2021 13:59]
44.
Minimal reducible bounds for 1-nonouterplanar graphs, 2000, Mieczysław Borowiecki , Mariusz Hałuszczak , Mirosława Skowrońska , Discrete Mathematics, Vol. 219, no 1-3, 9--15, ISSN: 0012-365X, bibliogr. rys. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 1 [06-05-2024]
[AWCZ-1940] [data modyf. 06-04-2021 13:59]
45.
Minimal reducible bounds for planar graphs, 2000, Mieczysław Borowiecki , Izak Broere , Peter Mihok , Discrete Mathematics, Vol. 212, no 1-2, 19--27, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: Additive, Hereditary, Minimal reducible bound, Planar graph, Property of graphs, Vertex partition
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 5 [06-05-2024]
[AWCZ-1941] [data modyf. 06-04-2021 13:58]
46.
Generalized independance and domination in graphs, 1998, Mieczysław Borowiecki , Danuta Michalak , Discrete Mathematics, Vol. 191, no 1-3, 51--56, ISSN: 0012-365X, bibliogr. summ.
Słowa kluczowe: Dominating set, Hereditary property of graphs, Independent set, Vertex partition
Kod: CZR-JCR BibTeX (pkt. 15)
[AWCZ-1960] [data modyf. 06-04-2021 13:59]
47.
Strong perfectness of the generalized Cartesian product of graphs, 1997, Maria Kwaśnik , Alina Szelecka , Discrete Mathematics, Vol. 164, 213--220, ISSN: 0012-365X, bibliogr. rys.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 3 [06-05-2024]
[AWCZ-5809] [data modyf. 06-04-2021 13:59]
48.
Infinite self-similar words, 1996, Jarosław Grytczuk , Discrete Mathematics, Vol. 161, 133--141, ISSN: 0012-365X, bibliogr. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 2 [06-05-2024]
[AWCZ-8322] [data modyf. 06-04-2021 13:59]
49.
The binding numbers of some Cartesian products of graphs, 1994, Danuta Michalak , Discrete Mathematics, Vol. 131, 363--366, ISSN: 0012-365X, bibliogr. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 0 [06-05-2024]
[AWCZ-8708] [data modyf. 06-04-2021 13:59]
50.
Classes of chromatically unique graphs, 1993, Mieczysław Borowiecki , Ewa Drgas-Burchardt , Discrete Mathematics, Vol. 111, no 1-3, 71--75, ISSN: 0012-365X, bibliogr. summ.
Kod: CZR-JCR BibTeX (pkt. [?])
Cytowania wg Scopus: 8 [06-05-2024]
[AWCZ-9932] [data modyf. 06-04-2021 13:59]