ARTICLE
TITLE

The 4-girth-thickness of the complete multipartite graph

SUMMARY

The g-girth-thickness ?(g, G) of a graph G is the smallest number of planar subgraphs of girth at least g whose union is G. In this paper, we calculate the 4-girth-thickness ?(4, G) of the complete m-partite graph G when each part has an even number of vertices.

PAGES
pp. 183–188

 Articles related

yerti putri    

ABSTRACTBurger and Vuuren (2004), generalized the concept of the size multipartite Ramsey number as follows. Let  and  be natural number with  and  then the size multipartite Ramsey number  is defined as the smallest natural numb... see more


Anie Lusiani,Edy Tri Baskoro,Suhadi Wido Saputro    

Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004. They have also determined the necessary and sufficient condi... see more


Raphael Yuster    

Let HH be a directed acyclic graph (dag) that is not a rooted star. It is known that there are constants c=c(H)c=c(H) and C=C(H)C=C(H) such that the following holds for DnD_n, the complete directed graph on nn vertices. There is a set of at most ClognC\l... see more


Preston Cranford, Anton Dochtermann, Evan Haithcock, Joshua Marsh, Suho Oh, Anna Truman    

A well-known conjecture of Richard Stanley posits that the hh-vector of the independence complex of a matroid is a pure O{\mathcal O}-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is a... see more


Peter J. Dukes, Esther R. Lamken, Alan C.H. Ling    

We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a stream... see more