The thickness of K1,n,n and K2,n,n

Guo, Xia; Yang, Yan

doi:10.26493/1855-3974.1223.b26

Ars Math. Contemp.

2018

DOI: 10.26493/1855-3974.1223.b26

|View full text |Cite

The thickness of K1,n,n and K2,n,n

Xia Guo

Yan Yang

Abstract: The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph

Help me understand this report

View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Relationship

Self Cite0

Independent0

Authors

Journals

Cited by 0 publications

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

No citations

Set email alert for when this publication receives citations?

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

The thickness of K1,n,n and K2,n,n

Abstract: The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph

Cited by 0 publications

References 8 publications

No citations

Contact Info

Product

Resources

About