The leafage of a chordal graph

Article Properties
Cite
Lin, In-Jen, et al. “The Leafage of a Chordal Graph”. Discussiones Mathematicae Graph Theory, vol. 18, no. 1, 1998, p. 23, https://doi.org/10.7151/dmgt.1061.
Lin, I.-J., McKee, T. A., & West, D. (1998). The leafage of a chordal graph. Discussiones Mathematicae Graph Theory, 18(1), 23. https://doi.org/10.7151/dmgt.1061
Lin IJ, McKee TA, West D. The leafage of a chordal graph. Discussiones Mathematicae Graph Theory. 1998;18(1):23.
Journal Category
Science
Mathematics
Citations
Title Journal Journal Categories Citations Publication Date
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs

 Networks
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Technology: Manufactures: Production management. Operations management
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2024
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage

 Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 1 2023
Domination and Cut Problems on Chordal Graphs with Bounded Leafage

 Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 2023
Parameterized complexity of multicut in weighted trees Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2023
An efficient algorithm for counting Markov equivalent DAGs Artificial Intelligence
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Mechanical engineering and machinery
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2 2022
Citations Analysis
Category Category Repetition
Science: Mathematics18
Technology: Engineering (General). Civil engineering (General)12
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods10
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software4
Science: Mathematics: Instruments and machines: Electronic computers. Computer science3
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Manufactures: Production management. Operations management2
Social Sciences: Commerce: Business: Personnel management. Employment management1
Social Sciences: Commerce: Business1
Social Sciences: Economic theory. Demography: Economics as a science1
Technology: Mechanical engineering and machinery1
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics1
The category Science: Mathematics 18 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Independent Sets in Asteroidal Triple-Free Graphs and was published in 1999. The most recent citation comes from a 2024 study titled Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. This article reached its peak citation in 2014, with 5 citations. It has been cited in 13 different journals. Among related journals, the Electronic Notes in Discrete Mathematics cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year