On P_4-tidy graphs

Article Properties
Abstract
Login
Cite
Giakoumakis, V., et al. “On P_4-Tidy Graphs”. Discrete Mathematics &Amp; Theoretical Computer Science, vol. Vol. 1, 1997, https://doi.org/10.46298/dmtcs.232.
Giakoumakis, V., Roussel, F., & Thuillier, H. (1997). On P_4-tidy graphs. Discrete Mathematics &Amp; Theoretical Computer Science, Vol. 1. https://doi.org/10.46298/dmtcs.232
Giakoumakis V, Roussel F, Thuillier H. On P_4-tidy graphs. Discrete Mathematics & Theoretical Computer Science. 1997;Vol. 1.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Citations
Login
Citations Analysis
Category Category Repetition
Science: Mathematics24
Technology: Engineering (General). Civil engineering (General)18
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods17
Science: Mathematics: Instruments and machines: Electronic computers. Computer science6
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware4
The first research to cite this article was titled An O(n) time algorithm for maximum matching in P4-tidy graphs and was published in 1997. The most recent citation comes from a 2023 study titled An O(n) time algorithm for maximum matching in P4-tidy graphs . This article reached its peak citation in 2011 , with 8 citations.It has been cited in 13 different journals. Among related journals, the Discrete Applied Mathematics cited this research the most, with 13 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year