A note on 3‐partite graphs without 4‐cycles
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21742
Abstract: Let C4 be a cycle of order 4. Write ex(n,n,n,C4) for the maximum number of edges in a balanced 3‐partite graph whose vertex set consists of three parts, each has n vertices that have no… read more here.
Keywords: graphs without; note partite; without cycles; partite graphs ... See more keywords
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithms"
DOI: 10.3390/a12010023
Abstract: Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S… read more here.
Keywords: enumerating maximal; partite graphs; finding enumerating; partite cliques ... See more keywords