Výsledky vyhledávání

Publikováno v: Bang-Jensen, J, Johansen, K S & Yeo, A 2023, ' Making a tournament k-strong ', Journal of Graph Theory, vol. 103, no. 1, pp. 5-11 . https://doi.org/10.1002/jgt.22900

A digraph is k‐strong if it has n ≥ k+1 vertices andeveryinduced subdigraph on at least n-k+1verticesis strongly connected. Atournament is a digraphwith no pair of nonadjacent vertices. We prove that everytournament on n ≥ k+1 vertices can be m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19824993639e2903964d478bb913f0f0
https://orbit.dtu.dk/en/publications/e7a6ce88-db15-46cf-b4d6-d29c5b31ba09

Zobrazit plný text záznamu

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs

Autor: Anders Yeo, Michael A. Henning

Publikováno v: Henning, M A & Yeo, A 2021, ' Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ', Discrete Applied mathematics, vol. 304, pp. 12-22 . https://doi.org/10.1016/j.dam.2021.07.004

Let H be a hypergraph of order n H = | V ( H ) | and size m H = | E ( H ) | . The transversal number τ ( H ) of H is the minimum number of vertices that intersect every edge of H . A linear hypergraph is one in which every two distinct edges interse

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d77d30e9398ae5590a56f0f1ce9b4627
https://doi.org/10.1016/j.dam.2021.07.004

Zobrazit plný text záznamu

A new upper bound on the total domination number in graphs with minimum degree six

Autor: Anders Yeo, Michael A. Henning

Publikováno v: Henning, M A & Yeo, A 2021, ' A new upper bound on the total domination number in graphs with minimum degree six ', Discrete Applied mathematics, vol. 302, pp. 1-7 . https://doi.org/10.1016/j.dam.2021.05.033

A total dominating set in a graph G is a set of vertices of G such that every vertex is adjacent to a vertex of the set. The total domination number γ t ( G ) is the minimum cardinality of a dominating set in G . Thomasse and Yeo (2007) conjectured

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::976c1aadb38025804c6e27475781ea6c
https://doi.org/10.1016/j.dam.2021.05.033

Zobrazit plný text záznamu

On Supereulerian 2-Edge-Coloured Graphs

Autor: Thomas Bellitto, Anders Yeo, Jørgen Bang-Jensen

Publikováno v: Bang-Jensen, J, Bellitto, T & Yeo, A 2021, ' On Supereulerian 2-Edge-Coloured Graphs ', Graphs and Combinatorics, vol. 37, no. 6, pp. 2601-2620 . https://doi.org/10.1007/s00373-021-02377-8
Graphs and Combinatorics

A 2-edge-coloured graph G is supereulerian if G contains a spanning closed trail in which the edges alternate in colours. We show that for general 2-edge-coloured graphs it is NP-complete to decide whether the graph is supereulerian. An eulerian fact

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::897af8de634f1ee25e66f3c18da8b5da
https://doi.org/10.1007/s00373-021-02377-8

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání