Well-covered graphs without cycles of lengths 4, 5 and 6

Article Properties
Cite
Levit, Vadim E., and David Tankus. “Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6”. Discrete Applied Mathematics, vol. 186, 2015, pp. 158-67, https://doi.org/10.1016/j.dam.2015.01.001.
Levit, V. E., & Tankus, D. (2015). Well-covered graphs without cycles of lengths 4, 5 and 6. Discrete Applied Mathematics, 186, 158-167. https://doi.org/10.1016/j.dam.2015.01.001
Levit, Vadim E., and David Tankus. “Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6”. Discrete Applied Mathematics 186 (2015): 158-67. https://doi.org/10.1016/j.dam.2015.01.001.
Levit VE, Tankus D. Well-covered graphs without cycles of lengths 4, 5 and 6. Discrete Applied Mathematics. 2015;186:158-67.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Weighted well-covered claw-free graphs Discrete Mathematics
  • Science: Mathematics
 9 2015
On relating edges in graphs without cycles of length 4 Journal of Discrete Algorithms 7 2014
Weighted well-covered graphs without C4, C5, C6, C7 Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
 7 2011
The structure of well-covered graphs with no cycles of length 4 Discrete Mathematics
  • Science: Mathematics
 14 2007
Local structure when all maximal independent sets have equal weight SIAM Journal on Discrete Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 1998
Refrences Analysis
Category Category Repetition
Science: Mathematics9
Technology: Engineering (General). Civil engineering (General)5
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware1
Technology: Manufactures: Production management. Operations management1
Science: Mathematics: Instruments and machines: Electronic computers. Computer science1
The category Science: Mathematics 9 is the most frequently represented among the references in this article. It primarily includes studies from Discrete Mathematics and Journal of Graph Theory. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$ Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • 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
Computing well-covered vector spaces of graphs using modular decomposition

 Computational and Applied Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2023
Weighted well-covered graphs without cycles of lengths 5, 6 and 7 Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2022
Recognizing Generating Subgraphs Revisited

 International Journal of Foundations of 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
 2021
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
 2 2020
Citations Analysis
Category Category Repetition
Science: Mathematics5
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods3
Science: Mathematics: Instruments and machines: Electronic computers. Computer science3
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software3
Technology: Engineering (General). Civil engineering (General)2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Technology (General): Industrial engineering. Management engineering: Information technology1
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication1
Science: Science (General): Cybernetics: Information theory1
The category Science: Mathematics 5 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Complexity Results for Generating Subgraphs and was published in 2017. The most recent citation comes from a 2023 study titled Computing well-covered vector spaces of graphs using modular decomposition. This article reached its peak citation in 2023, with 2 citations. It has been cited in 7 different journals. Among related journals, the Computational and Applied Mathematics cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year