Subgraphs and well‐quasi‐ordering
Journal of Graph Theory, ISSN: 1097-0118, Vol: 16, Issue: 5, Page: 489-502
1992
- 72Citations
- 13Usage
- 7Captures
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
- Citations72
- Citation Indexes72
- 72
- CrossRef53
- Usage13
- Abstract Views13
- Captures7
- Readers7
Article Description
Let 𝒴 be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an ideal (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, we characterize the well‐quasi‐ordered ideals in terms of exluding subgraphs. If⪯is the induced subgraph relation, we present three wellquasi‐ordered ideals. We also construct examples to disprove some of the possible generalizations of our results. The connections between some of our results and digraphs are considered in this paper too. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
Bibliographic Details
https://repository.lsu.edu/mathematics_pubs/447; https://digitalcommons.lsu.edu/mathematics_pubs/447
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84987491031&origin=inward; http://dx.doi.org/10.1002/jgt.3190160509; https://onlinelibrary.wiley.com/doi/10.1002/jgt.3190160509; https://repository.lsu.edu/mathematics_pubs/447; https://repository.lsu.edu/cgi/viewcontent.cgi?article=1446&context=mathematics_pubs; https://digitalcommons.lsu.edu/mathematics_pubs/447; https://digitalcommons.lsu.edu/cgi/viewcontent.cgi?article=1446&context=mathematics_pubs
Wiley
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know