On nowhere dense graphs

Article Properties
Cite
Nešetřil, Jaroslav, and Patrice Ossona de Mendez. “On Nowhere Dense Graphs”. European Journal of Combinatorics, vol. 32, no. 4, 2011, pp. 600-17, https://doi.org/10.1016/j.ejc.2011.01.006.
Nešetřil, J., & Ossona de Mendez, P. (2011). On nowhere dense graphs. European Journal of Combinatorics, 32(4), 600-617. https://doi.org/10.1016/j.ejc.2011.01.006
Nešetřil, Jaroslav, and Patrice Ossona de Mendez. “On Nowhere Dense Graphs”. European Journal of Combinatorics 32, no. 4 (2011): 600-617. https://doi.org/10.1016/j.ejc.2011.01.006.
Nešetřil J, Ossona de Mendez P. On nowhere dense graphs. European Journal of Combinatorics. 2011;32(4):600-17.
Journal Category
Science
Mathematics
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
First order properties on nowhere dense structures

 The Journal of Symbolic Logic
  • Science: Mathematics
  • Science: Mathematics
 26 2010
Colouring graphs with bounded generalized colouring number Discrete Mathematics
  • Science: Mathematics
 41 2009
Fraternal augmentations, arrangeability and linear Ramsey numbers European Journal of Combinatorics
  • Science: Mathematics
 7 2009
Homomorphism preservation theorems

 Journal of the ACM
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • 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
 43 2008
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities European Journal of Combinatorics
  • Science: Mathematics
 37 2008
Refrences Analysis
Category Category Repetition
Science: Mathematics12
Science: Mathematics: Instruments and machines: Electronic computers. Computer science9
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software7
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware7
Science: Science (General): Cybernetics: Information theory3
Science: Mathematics: Probabilities. Mathematical statistics2
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
Technology: Technology (General): Industrial engineering. Management engineering: Information technology1
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication1
The category Science: Mathematics 12 is the most frequently represented among the references in this article. It primarily includes studies from Combinatorica and Journal of the ACM. 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
Neighbourhood complexity of graphs of bounded twin-width European Journal of Combinatorics
  • Science: Mathematics
 2024
Twin-width IV: ordered graphs and matrices

 Journal of the ACM
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • 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
 2024
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes 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
Hat Guessing Numbers of Strongly Degenerate Graphs 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)
 2023
Modularity of minor‐free graphs

 Journal of Graph Theory
  • Science: Mathematics
 2022
Citations Analysis
Category Category Repetition
Science: Mathematics30
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software19
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware17
Science: Mathematics: Instruments and machines: Electronic computers. Computer science15
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods12
Technology: Engineering (General). Civil engineering (General)8
Science: Science (General): Cybernetics: Information theory5
Technology: Technology (General): Industrial engineering. Management engineering1
The category Science: Mathematics 30 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Confronting intractability via parameters and was published in 2011. The most recent citation comes from a 2024 study titled Twin-width IV: ordered graphs and matrices. This article reached its peak citation in 2021, with 7 citations. It has been cited in 21 different journals, 4% of which are open access. Among related journals, the European Journal of Combinatorics cited this research the most, with 11 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year