On the Chromatic Number of (P , Diamond)-Free Graphs
Graphs and Combinatorics, ISSN: 0911-0119, Vol: 34, Issue: 4, Page: 677-692
2018
- 15Citations
- 4Usage
- 6Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations15
- Citation Indexes14
- 14
- CrossRef2
- Policy Citations1
- 1
- Usage4
- Abstract Views4
- Captures6
- Readers6
Article Description
In this paper, we first show that every (P, diamond, K)-free graph is 6-colorable. We also give an example of a (P, diamond, K)-free graph G with χ(G) = 6. Further, we show that for every (P, diamond)-free graph G, the chromatic number of G is upper bounded by a linear function of its clique number. This generalizes some known results in the literature.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85047116367&origin=inward; http://dx.doi.org/10.1007/s00373-018-1905-9; http://link.springer.com/10.1007/s00373-018-1905-9; http://link.springer.com/content/pdf/10.1007/s00373-018-1905-9.pdf; http://link.springer.com/article/10.1007/s00373-018-1905-9/fulltext.html; https://digitalcommons.isical.ac.in/journal-articles/1324; https://digitalcommons.isical.ac.in/cgi/viewcontent.cgi?article=3078&context=journal-articles; https://dx.doi.org/10.1007/s00373-018-1905-9; https://link.springer.com/article/10.1007/s00373-018-1905-9
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know