Coloring immersion-free graphs (Q326817)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Coloring immersion-free graphs	scientific article

Statements

scholarly article

0 references

Coloring immersion-free graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.jctb.2016.07.005

0 references

Naonori Kakimura

0 references

Ken-ichi Kawarabayashi

0 references

Journal of Combinatorial Theory. Series B

0 references

publication date

12 October 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

immersion

0 references

coloring

0 references

fixed-parameter algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jctb.2016.07.005

0 references

0 references

Graph Coloring and the Immersion Order

0 references

Every planar map is four colorable. I: Discharging

0 references

Every planar map is four colorable. II: Reducibility

0 references

Linear time algorithms for NP-hard problems restricted to partial k- trees

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

Topological cliques of random graphs

0 references

Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs

0 references

A bound on the chromatic number of a graph

0 references

Polynomial bounds for the grid-minor theorem

0 references

Immersion in four-edge-connected graphs

0 references

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

0 references

Immersing small complete graphs

0 references

A minimum degree condition forcing complete graph immersion

0 references

Highly connected sets and the excluded grid theorem

0 references

On the conjecture of Hajos

0 references

0 references

Zero knowledge and the chromatic number

0 references

0 references

Clique is hard to approximate within \(n^{1-\epsilon}\)

0 references

0 references

25 pretty graph colouring problems

0 references

The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs

0 references

0 references

The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs

0 references

Edge-disjoint odd cycles in 4-edge-connected graphs

0 references

The disjoint paths problem in quadratic time

0 references

Topological cliques in graphs II

0 references

Lower bound of the Hadwiger number of graphs by their average degree

0 references

0 references

Immersions in Highly Edge Connected Graphs

0 references

AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

0 references

0 references

The four-colour theorem

0 references

Graph minors. V. Excluding a planar graph

0 references

Graph minors. XIII: The disjoint paths problem

0 references

Graph minors. XX: Wagner's conjecture

0 references

Graph minors XXIII. Nash-Williams' immersion conjecture

0 references

Hadwiger's conjecture for \(K_ 6\)-free graphs

0 references

Quickly excluding a planar graph

0 references

An extremal function for contractions of graphs

0 references

Some remarks on Hajós' conjecture

0 references

Über eine Eigenschaft der ebenen Komplexe

0 references

The structure of graphs not admitting a fixed immersion

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:326817

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