Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Defective and clustered choosability of sparse graphs - MaRDI portal

Defective and clustered choosability of sparse graphs (Q5222556)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7186363

Language	Label	Description	Also known as
English	Defective and clustered choosability of sparse graphs	scientific article; zbMATH DE number 7186363

Statements

scholarly article

0 references

Defective and clustered choosability of sparse graphs (English)

0 references

zbMATH Open document ID

0 references

10.1017/S0963548319000063

0 references

0 references

0 references

Combinatorics, Probability and Computing

0 references

publication date

6 April 2020

0 references

full work available at URL

https://arxiv.org/abs/1806.07040

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

choosability of graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number

0 references

Partitioning into graphs with only small components

0 references

A note on defective colorings of graphs in surfaces

0 references

List strong linear 2-arboricity of sparse graphs

0 references

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

0 references

\((k,j)\)-coloring of sparse graphs

0 references

\((k,1)\)-coloring of sparse graphs

0 references

Defective 2-colorings of sparse graphs

0 references

On 1-improper 2-coloring of sparse graphs

0 references

Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs

0 references

Improper coloring of graphs on surfaces

0 references

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency

0 references

Defective coloring revisited

0 references

Planar graphs are 1-relaxed, 4-choosable

0 references

Limits of Near-Coloring of Sparse Graphs

0 references

Layouts of Expander Graphs

0 references

0 references

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

0 references

0 references

A Relative of Hadwiger's Conjecture

0 references

Islands in Graphs on Surfaces

0 references

Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs

0 references

Improper choosability of graphs and maximum average degree

0 references

A Note on Vertex List Colouring

0 references

Bounded size components -- partitions and transversals.

0 references

Improper colourings inspired by Hadwiger's conjecture

0 references

Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon

0 references

Variations on Ringel's earth-moon problem

0 references

Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs

0 references

Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions

0 references

Maximum average degree and relaxed coloring

0 references

0 references

The thickness of graphs: A survey

0 references

Clustered colouring in minor-closed classes

0 references

Defective colouring of graphs excluding a subgraph or minor

0 references

0 references

Defective and clustered graph colouring

0 references

Defective choosability of graphs in surfaces

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5222556

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