Skip to main navigation
Skip to search
Skip to main content
Houston Methodist Scholars Home
Help & FAQ
Link opens in a new tab
Search content at Houston Methodist Scholars
Home
Experts
Research units
Research output
Prizes
A note on [r, s, c, t]-colorings of graphs
Jian Ting Sheng
, Gui Zhen Liu
Houston Methodist
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A note on [r, s, c, t]-colorings of graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Edge Cover
100%
Graph Coloring
100%
Chromatic number
60%
Color Forms
40%
All-pairs
20%
Minimum number
20%
Even Cycle
20%
Vertex Set
20%
Simple Graph
20%
G-set
20%
Non-negative Integer
20%
Spanning Subgraph
20%
Edge Set
20%
Maximum number of Edges
20%
Number of Edges
20%
Color Set
20%
Edge Covering
20%
Mathematics
Edge
100%
Edge Cover
100%
Chromatic Number
60%
Independent Set
60%
Nonnegative Integer
20%
Induced Subgraph
20%
Simple Graph
20%
Computer Science
Independent Set
100%
Chromatic Number
100%
Subgraphs
66%
Nonnegative Integer
33%
Engineering
Chromatic Number
100%
Exact Value
33%