Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Wojda, Adam Pawel"'
Autor:
WOJDA, ADAM PAWEL1 wojda@uci.agh.edu.pl
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 2, p607-610. 4p.
Let l be a positive integer, k = 2l or k = 2l + 1 and let n be a positive integer with $n \equiv 1$ (mod $2^{l+1}$). Potocnik and Sajna showed that if there exists a vertex-transitive self-complementary k-hypergraph of order n, then for every prime p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8b01b1ec72fc4ddc1ba5009a0e0ceffb
https://hal.archives-ouvertes.fr/hal-02302371/document
https://hal.archives-ouvertes.fr/hal-02302371/document
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2012, 312 (14), pp.2109-2118. ⟨10.1016/j.disc.2011.04.017⟩
Discrete Mathematics, Elsevier, 2012, 312 (14), pp.2109-2118. ⟨10.1016/j.disc.2011.04.017⟩
International audience; A graph G is a (Kq; k) vertex stable graph if it contains a Kq after deleting any subset of k vertices. We give a characterization of (Kq; k) vertex stable graphs with minimum size for q = 3; 4; 5.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::461aa8a2c2ac7bf72b0d8a5b011cbc23
https://hal.archives-ouvertes.fr/hal-00934323/document
https://hal.archives-ouvertes.fr/hal-00934323/document
A strong matching C in a graph G is a matching C such that there is no edge of E(G) connecting any two edges of C. A cubic graph G is a Jaeger's graph if it contains a perfect matching which is a union of two disjoint strong matchings. We survey here
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b7c79bd63f9db58bebd0e1ad06b4365b
https://hal.archives-ouvertes.fr/hal-00601554/file/jaegers-graphs.pdf
https://hal.archives-ouvertes.fr/hal-00601554/file/jaegers-graphs.pdf
Publikováno v:
[Research Report] 2011, pp.9
A graph G is a (K_q; k) vertex stable graph (q >= 3) if it contains a clique K_q after deleting any subset of k vertices (k >= 0). We are interested by the (K_q; kappa(q)) vertex stable graphs of minimum size where kappa(q) is the maximum value for w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cd079b6215f6d720c5f0b7204320dc84
https://hal.inria.fr/hal-00648505
https://hal.inria.fr/hal-00648505
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.