Large Independent Sets in Subquartic Planar Graphs (Q2803824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4111622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Cut Parameterized above the Edwards-Erdős Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Independent Sets in Triangle-Free Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic triangle-free graphs have fractional chromatic number at most 14/5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Cycle Transversals and Independent Sets in Fullerene Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum independent sets in 3- and 4-regular Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate tree decompositions of planar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fractional Analogue of Brooks' Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisections above Tight Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897434 / rank
 
Normal rank

Latest revision as of 22:35, 11 July 2024

scientific article
Language Label Description Also known as
English
Large Independent Sets in Subquartic Planar Graphs
scientific article

    Statements

    Large Independent Sets in Subquartic Planar Graphs (English)
    0 references
    0 references
    3 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers