The Parameterized Complexity of Graph Cyclability (Q5891809): Difference between revisions

From MaRDI portal
Merged Item from Q5892329
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Minor Testing in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Linkages in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through 23 vertices in 3-connected cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding grids in surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4173190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shorter proof of the graph minor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nine vertex theorem for 3-connected claw- free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXII. Irrelevant vertices in linkage problems / 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: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXI. graphs with unique linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank

Latest revision as of 13:15, 13 July 2024

scientific article; zbMATH DE number 6695759
Language Label Description Also known as
English
The Parameterized Complexity of Graph Cyclability
scientific article; zbMATH DE number 6695759

    Statements

    The Parameterized Complexity of Graph Cyclability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2014
    0 references
    16 March 2017
    0 references
    cyclability
    0 references
    linkages
    0 references
    treewidth
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references