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
The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles
Sign Up to like & getrecommendations! Published in 2023 at "Axioms"
DOI: 10.3390/axioms12020173
Abstract: A graph G has a (d,h)-decomposition if there is a pair (D,F) such that F is a subgraph of G and D is an acyclic orientation of G−E(F), where the maximum degree of F is… read more here.
Keywords: without adjacent; decomposability toroidal; graphs without; toroidal graphs ... See more keywords