Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9978-3
Abstract: Let $$K_n$$Kn be a complete graph drawn on the plane with every vertex incident to the infinite face. For any integers i and d, we define the (i, d)-Trinque Number of $$K_n$$Kn, denoted by $${\mathcal {T}}^d_{i}(K_n)$$Tid(Kn),… read more here.
Keywords: graphs; problem covering; covering complete; trinque problem ... See more keywords