On the number of labeled graphs of bounded treewidth (Q5915790): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6821991
scientific article; zbMATH DE number 6870114
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1387.05114 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2018.02.030 / rank
 
Normal rank
Property / published in
 
Property / published in: European Journal of Combinatorics / rank
 
Normal rank
Property / publication date
 
18 May 2018
Timestamp+2018-05-18T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 18 May 2018 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6870114 / rank
 
Normal rank
Property / zbMATH Keywords
 
labeled \(k\)-trees
Property / zbMATH Keywords: labeled \(k\)-trees / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963386661 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790333339 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.07273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and limit laws for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Time Algorithms for Finding Small Tree and Path Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Time Algorithms for Embedding H-Minor Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic analysis of labeled and unlabeled \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Gamma \)-species and the enumeration of \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting unlabeled \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Planarization Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random planar graphs, the number of planar graphs and their triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Distinct Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed searching and proper-path-width / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:25, 15 July 2024

scientific article; zbMATH DE number 6870114
Language Label Description Also known as
English
On the number of labeled graphs of bounded treewidth
scientific article; zbMATH DE number 6870114

    Statements

    On the number of labeled graphs of bounded treewidth (English)
    0 references
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    18 May 2018
    0 references
    treewidth
    0 references
    partial \(k\)-trees
    0 references
    enumeration
    0 references
    pathwidth
    0 references
    proper-pathwidth
    0 references
    labeled \(k\)-trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references