Counting Homomorphisms to Sparse Graphs (Q2851494): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.07.065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972811990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Model Theory on Tame Classes of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order properties on nowhere dense structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Latest revision as of 23:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Counting Homomorphisms to Sparse Graphs
scientific article

    Statements

    Counting Homomorphisms to Sparse Graphs (English)
    0 references
    10 October 2013
    0 references
    0 references
    graph
    0 references
    counting
    0 references
    homomorphism
    0 references
    Boolean query
    0 references
    tree-depth
    0 references
    nowhere dense class
    0 references
    0 references