Name
Abstract | ||
|---|---|---|
The 4-girth-thickness theta(4, G) of a graph G is the minimum number of planar subgraphs of girth at least four whose union is G. In this paper, we obtain that the 4-girth-thickness of complete tripartite graph K-n,K- n,K- n is inverted right perpendicular n+1/2 inverted left perpendicular except for theta(4, K-1,K- 1,K- 1) = 2. And we also show that the 4-girth-thickness of the complete graph K-10 is three which disprove the conjecture posed by Rubio-Montiel concerning to theta(4, K-10). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.26493/1855-3974.1488.182 | ARS MATHEMATICA CONTEMPORANEA |
Keywords | Field | DocType |
Thickness,4-girth-thickness,complete tripartite graph | Complete graph,Graph,Discrete mathematics,Combinatorics,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 1 | 1855-3966 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||