Zobrazeno 1 - 10
of 41
pro vyhledávání: '"A. Paweł Wojda"'
Autor:
Aneta Dudek, A. Paweł Wojda
Publikováno v:
Opuscula Mathematica, Vol 24, Iss 1, Pp 43-55 (2004)
By \(P_m\) we denote a path of order \(m\). A graph \(G\) is said to be \(P_m\)-saturated if \(G\) has no subgraph isomorphic to \(P_m\) and adding any new edge to \(G\) creates a \(P_m\) in \(G\). In 1986 L. Kászonyi and Zs. Tuza considered the fol
Externí odkaz:
https://doaj.org/article/165bfa6897124d30af9befc5b1e21370
Publikováno v:
In Discrete Applied Mathematics 2006 154(9):1372-1379
Publikováno v:
In Electronic Notes in Discrete Mathematics 2000 5:307-310
Publikováno v:
Discrete Mathematics. 307:1525-1537
We give sufficient Ore-type conditions for a balanced bipartite graph to contain every matching in a hamiltonian cycle or a cycle not necessarily hamiltonian. Moreover, for the hamiltonian case we prove that the condition is almost best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d19f6031597b1336ae851367ed748be1
https://doi.org/10.1016/j.disc.2005.11.090
https://doi.org/10.1016/j.disc.2005.11.090
Autor:
Lech Adamus, A. Paweł Wojda
Publikováno v:
Graphs and Combinatorics. 22:443-452
We prove that every digraph D with n≥7, n≥ **+6 vertices and at least (n−k−1)(n−1)+k(k+1) arcs contains all symmetric cycles of length at most n−k−2, an almost symmetric cycle of length n−k−1, and with some exceptions, also an almos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e17c4475da400c09969998b98e52edba
https://doi.org/10.1007/s00373-006-0668-x
https://doi.org/10.1007/s00373-006-0668-x
Autor:
Artur Szymański, A. Paweł Wojda
Publikováno v:
Electronic Notes in Discrete Mathematics. 24:291-294
A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::894969bb81d4f82cad70e3ea609df8d3
https://doi.org/10.1016/j.endm.2006.06.023
https://doi.org/10.1016/j.endm.2006.06.023
Autor:
Beata Orchel, A. Paweł Wojda
Publikováno v:
Electronic Notes in Discrete Mathematics. 24:285-289
Bipartite graphs G = ( L , R ; E ) and H = ( L ′ , R ′ ; E ′ ) are bi-placeabe if there is a bijection f : L ∪ R → L ′ ∪ R ′ such that f ( L ) = L ′ and f ( u ) f ( v ) ∉ E ′ for every edge u v ∈ E ). We prove that if G and H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f832fb74b8f68d54ae8607c0bd96687
https://doi.org/10.1016/j.endm.2006.06.024
https://doi.org/10.1016/j.endm.2006.06.024
Publikováno v:
Discrete Applied Mathematics. 154:1372-1379
A graph G is said to be hamiltonian path saturated (HPS for short), if G has no hamiltonian path but any addition of a new edge in G creates a hamiltonian path in G. It is known that an HPS graph of order n has size at most (n-1 2) and, for n ≥ 6,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f855ef0d6b70770614db64a2c7f02a6
https://doi.org/10.1016/j.dam.2005.05.035
https://doi.org/10.1016/j.dam.2005.05.035
Publikováno v:
Discrete Mathematics. 292:167-185
We prove that, with one exception, each (n,n)-graph G that is embeddable in its complement has a self-complementary supergraph of order n.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8359d7d12d7baee28b96153200c8f014
https://doi.org/10.1016/j.disc.2004.10.022
https://doi.org/10.1016/j.disc.2004.10.022