Large Independent Sets in Subquartic Planar Graphs (Q2803824)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Large Independent Sets in Subquartic Planar Graphs (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-30139-6_17

0 references

0 references

WALCOM: Algorithms and Computation

0 references

publication date

3 May 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-30139-6_17

0 references

0 references

0 references

Every planar map is four colorable

0 references

On the existence of subexponential parameterized algorithms

0 references

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average

0 references

Max-Cut Parameterized above the Edwards-Erdős Bound

0 references

Parameterized Algorithms

0 references

On Multiway Cut Parameterized above Lower Bounds

0 references

Large Independent Sets in Triangle-Free Planar Graphs

0 references

Subcubic triangle-free graphs have fractional chromatic number at most 14/5

0 references

Subgraph Isomorphism in Planar Graphs and Related Problems

0 references

Odd Cycle Transversals and Independent Sets in Fullerene Graphs

0 references

Maximum independent sets in 3- and 4-regular Hamiltonian graphs

0 references

0 references

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting

0 references

Local tree-width, excluded minors, and approximation algorithms

0 references

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

0 references

Betweenness parameterized above tight lower bound

0 references

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

0 references

Independent sets in triangle-free cubic planar graphs

0 references

Approximate tree decompositions of planar graphs in linear time

0 references

A Fractional Analogue of Brooks' Theorem

0 references

The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)

0 references

Parameterizing above Guaranteed Values: MaxSat and MaxCut

0 references

Parameterizing above or below guaranteed values

0 references

Bisections above Tight Lower Bounds

0 references

Graph colouring and the probabilistic method

0 references

0 references

The four-colour theorem

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2803824

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2803824&oldid=36246728"