1 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2017★ 1 cited
The 6-girth-thickness of the complete graph
Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort +2
The -girth-thickness of a graph is the minimum number of planar subgraphs of girth at least whose union is . In this paper, we determine the -girth-thickn…
math.CO2017★ 1 cited
The 4-girth-thickness of the complete multipartite graph
Christian Rubio-Montiel
The -girth-thickness of a graph is the smallest number of planar subgraphs of girth at least whose union is . In this paper, we calculate the -girth-thick…