Skip to main navigation
Skip to search
Skip to main content
Discovery - the University of Dundee Research Portal Home
Home
Profiles
Research units
Research Outputs
Projects
Datasets
Theses
Activity
Press/Media
Research Facilities
Prizes
Search by expertise, name or affiliation
Achromatic number of fragmentable graphs
Keith Edwards
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Achromatic number of fragmentable graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Edge
100%
Necessary and Sufficient Condition
100%
Triangle
100%
Simple Graph
100%
Polynomial Time
100%
Planar Graph
100%
Keyphrases
Fragmentable
100%
Achromatic number
100%
Color number
28%
Complete Coloring
28%
Large Graphs
28%
Planar Graph
14%
Bounded Degree
14%
Simple Graph
14%
Proper Vertex Coloring
14%
Graph Theory
14%
Planar Grid
14%
Graph Families
14%
J-graph
14%
NP-complete
14%
Fixed Dimension
14%
Polynomial Time
14%
Triangle-free
14%
Tight Lower Bound
14%