Tree representations of graphs
European Journal of Combinatorics, ISSN: 0195-6698, Vol: 28, Issue: 4, Page: 1087-1098
2007
- 4Citations
- 2Usage
- 3Captures
Metric Options: Counts1 Year3 YearSelecting 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
- Citations4
- Citation Indexes4
- CrossRef2
- Usage2
- Abstract Views2
- Captures3
- Readers3
Article Description
A graph is chordal if and only if it is the intersection graph of some family of subtrees of a tree. Applying “tolerance” allows larger families of graphs to be represented by subtrees. A graph G is in the family [Δ,d,t] if there is a tree with maximum degree Δ and subtrees corresponding to the vertices of G such that each subtree has maximum degree at most d and two vertices of G are adjacent if and only if the subtrees corresponding to them have at least t common vertices.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0195669806000576; http://dx.doi.org/10.1016/j.ejc.2006.04.002; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=33847680149&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0195669806000576; https://api.elsevier.com/content/article/PII:S0195669806000576?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0195669806000576?httpAccept=text/plain; https://digitalcommons.uri.edu/math_facpubs/116; https://digitalcommons.uri.edu/cgi/viewcontent.cgi?article=1118&context=math_facpubs; https://dx.doi.org/10.1016/j.ejc.2006.04.002
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know