Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Every planar graph is 1-defective (9,2)-paintable
Ming Han
,
H. A. Kierstead
, Xuding Zhu
Mathematical and Statistical Sciences, School of (SoMSS)
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Every planar graph is 1-defective (9,2)-paintable'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Painters
100%
Planar Graph
100%
Token
75%
Winning Strategy
50%
Maximum Degree
25%
Natural numbers
25%
Painting Game
25%
Mathematics
Defectives
100%
Planar Graph
100%
Winning Strategy
40%
Maximum Degree
20%
Natural Number
20%