Bi-complement Reducible Graphs

Article Properties
Cite
Giakoumakis, Vassilis, and Jean-Marie Vanherpe. “Bi-Complement Reducible Graphs”. Advances in Applied Mathematics, vol. 18, no. 4, 1997, pp. 389-02, https://doi.org/10.1006/aama.1996.0519.
Giakoumakis, V., & Vanherpe, J.-M. (1997). Bi-complement Reducible Graphs. Advances in Applied Mathematics, 18(4), 389-402. https://doi.org/10.1006/aama.1996.0519
Giakoumakis V, Vanherpe JM. Bi-complement Reducible Graphs. Advances in Applied Mathematics. 1997;18(4):389-402.
Journal Categories
Science
Mathematics
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
Title Journal Journal Categories Citations Publication Date
Linear time optimization algorithms forP4 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)
1995
Classes of bipartite graphs related to chordal graphs 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)
1991
A Linear Recognition Algorithm for Cographs SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • 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
288 1985
Complement reducible graphs 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)
1981
Operational Statistics. I. Basic Concepts

Journal of Mathematical Physics
  • Science: Mathematics
  • Science: Physics
122 1972
Citations
Title Journal Journal Categories Citations Publication Date
Bipartite (P6,C6)-Free Graphs: Recognition and Optimization Problems

Symmetry
  • Science: Mathematics
  • Science: Science (General)
2024
Decomposition of <i>P</i><sub>6</sub>-Free Chordal Bipartite Graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Science (General): Cybernetics: Information theory
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
2023
The micro-world of cographs 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)
3 2022
Transducing paths in graph classes with unbounded shrubdepth European Journal of Combinatorics
  • Science: Mathematics
2022
Regular partitions of gentle graphs Acta Mathematica Hungarica
  • Science: Mathematics
2 2020
Citations Analysis
The category Science: Mathematics 12 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On canonical decomposition of bipartite graphs and was published in 1999. The most recent citation comes from a 2024 study titled Bipartite (P6,C6)-Free Graphs: Recognition and Optimization Problems. This article reached its peak citation in 2020, with 4 citations. It has been cited in 12 different journals, 8% of which are open access. Among related journals, the Discrete Mathematics cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year