On the public citation graph
Defective and Clustered Graph Colouring
0 signed · 168 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1098-2418(200007)16:4<364::aid-rsa5>3.0.co;2-0openalex-snapshot
Degrees and choice numbers
inferredcites →https://doi.org/10.1002/jgt.10153openalex-snapshot
Defective choosability of graphs with no edge‐plus‐independent‐set minor
inferredcites →https://doi.org/10.1002/jgt.20490openalex-snapshot
On vertex partitions and some minor-monotone graph parameters
inferredcites →https://doi.org/10.1002/jgt.20516openalex-snapshot
List strong linear 2-arboricity of sparse graphs
inferredcites →https://doi.org/10.1002/jgt.20546openalex-snapshot
The number of defective colorings of graphs on surfaces
inferredcites →https://doi.org/10.1002/jgt.21868openalex-snapshot
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
inferredcites →https://doi.org/10.1002/jgt.3190070410openalex-snapshot
Knots and links in spatial graphs
inferredcites →https://doi.org/10.1002/jgt.3190100207openalex-snapshot
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
inferredcites →https://doi.org/10.1002/jgt.3190110408openalex-snapshot
A note on defective colorings of graphs in surfaces
inferredcites →https://doi.org/10.1002/jgt.3190140108openalex-snapshot
On the linear vertex‐arboricity of a planar graph
inferredcites →https://doi.org/10.1002/jgt.3190180305openalex-snapshot
New upper bounds on harmonious colorings
inferredcites →https://doi.org/10.1002/jgt.3190200412openalex-snapshot
Some results on tree decomposition of graphs
inferredcites →https://doi.org/10.1002/mana.19941700103openalex-snapshot
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
inferredcites →https://doi.org/10.1006/jctb.1994.1062openalex-snapshot
Every Planar Graph Is 5-Choosable
inferredcites →https://doi.org/10.1006/jctb.1995.1032openalex-snapshot
Sachs′ Linkless Embedding Conjecture
inferredcites →https://doi.org/10.1006/jctb.2000.1962openalex-snapshot
Surfaces, Tree-Width, Clique-Minors, and Partitions
inferredcites →https://doi.org/10.1006/jctb.2000.2013openalex-snapshot
The Extremal Function for Complete Minors
inferredcites →https://doi.org/10.1007/3-540-45071-8_40openalex-snapshot
Graph Coloring and the Immersion Order
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/978-3-642-10217-2_4openalex-snapshot
Kt Minors in Large t-Connected Graphs
inferredcites →https://doi.org/10.1007/bf01202354openalex-snapshot
Hadwiger's conjecture forK 6-free graphs
inferredcites →https://doi.org/10.1007/bf01202473openalex-snapshot
Relaxed chromatic numbers of graphs
inferredcites →https://doi.org/10.1007/bf01215922openalex-snapshot
Graphs drawn with few crossings per edge
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/bf02052726openalex-snapshot
Über trennende Eckenmengen in homomorphiekritischen Graphen
inferredcites →https://doi.org/10.1007/bf02193046openalex-snapshot
Triples, current graphs and biembeddings
inferredcites →https://doi.org/10.1007/bf02579141openalex-snapshot
Lower bound of the hadwiger number of graphs by their average degree
inferredcites →https://doi.org/10.1007/bfb0071633openalex-snapshot
On a spatial analogue of Kuratowski's theorem on planar graphs — An open problem
inferredcites →https://doi.org/10.1007/s00373-008-0833-5openalex-snapshot
Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs
inferredcites →https://doi.org/10.1007/s00373-014-1438-9openalex-snapshot
On Improperly Chromatic-Choosable Graphs
inferredcites →https://doi.org/10.1007/s00454-013-9490-4openalex-snapshot
An Analogue of Gromov’s Waist Theorem for Coloring the Cube
inferredcites →https://doi.org/10.1007/s00454-013-9504-2openalex-snapshot
Size of Components of a Cube Coloring
inferredcites →https://doi.org/10.1007/s00493-014-2806-zopenalex-snapshot
A minimum degree condition forcing complete graph immersion
inferredcites →https://doi.org/10.1007/s00493-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
inferredcites →https://doi.org/10.1007/s12044-016-0272-9openalex-snapshot
(3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles
inferredcites →https://doi.org/10.1016/0012-365x(78)90147-4openalex-snapshot
Covering the vertex set of a graph with subgraphs of smaller degree
inferredcites →https://doi.org/10.1016/0012-365x(87)90243-3openalex-snapshot
On a theorem about vertex colorings of graphs
inferredcites →https://doi.org/10.1016/0012-365x(94)90260-7openalex-snapshot
Extremal results on defective colorings of graphs
inferredcites →https://doi.org/10.1016/0095-8956(77)90037-5openalex-snapshot
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1016/j.aam.2017.04.005openalex-snapshot
On the complexity of generalized chromatic polynomials
inferredcites →https://doi.org/10.1016/j.camwa.2008.03.036openalex-snapshot
Improper choosability of graphs of nonnegative characteristic
inferredcites →https://doi.org/10.1016/j.dam.2004.10.005openalex-snapshot
On monochromatic component size for improper colourings
inferredcites →https://doi.org/10.1016/j.dam.2011.10.019openalex-snapshot
A (3,1)∗ -choosable theorem on toroidal graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.11.018openalex-snapshot
Directed weighted improper coloring for cellular channel allocation
inferredcites →https://doi.org/10.1016/j.disc.2006.03.027openalex-snapshot
List colourings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.09.009openalex-snapshot
Acyclic improper colourings of graphs with bounded maximum degree
inferredcites →https://doi.org/10.1016/j.disc.2010.08.013openalex-snapshot
On minimal triangle-free graphs with prescribed k -defective chromatic number
inferredcites →https://doi.org/10.1016/j.disc.2012.11.011openalex-snapshot
Colorings of plane graphs: A survey
inferredcites →https://doi.org/10.1016/j.disc.2013.07.014openalex-snapshot
On 1 -improper 2 -coloring of sparse graphs
inferredcites →https://doi.org/10.1016/j.disc.2015.10.029openalex-snapshot
Planar graphs without cycles of length 4 or 5 are (2,0,0) -colorable
inferredcites →https://doi.org/10.1016/j.disc.2017.04.006openalex-snapshot
Every planar graph without cycles of length 4 or 9 is (1,1,0) -colorable
inferredcites →https://doi.org/10.1016/j.ejc.2009.11.013openalex-snapshot
Planar graphs are 1-relaxed, 4-choosable
inferredcites →https://doi.org/10.1016/j.ejc.2010.05.015openalex-snapshot
Contractibility and the Hadwiger Conjecture
inferredcites →https://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferredcites →https://doi.org/10.1016/j.ejc.2015.12.004openalex-snapshot
Locally planar graphs are 2-defective 4-paintable
inferredcites →https://doi.org/10.1016/j.jctb.2003.09.001openalex-snapshot
Excluding any graph as a minor allows a low tree-width 2-coloring
inferredcites →https://doi.org/10.1016/j.jctb.2005.07.008openalex-snapshot
The extremal function for K9 minors
inferredcites →https://doi.org/10.1016/j.jctb.2006.11.002openalex-snapshot
A relaxed Hadwiger's Conjecture for list colorings
inferredcites →https://doi.org/10.1016/j.jctb.2006.12.001openalex-snapshot
Relaxed two-coloring of cubic graphs
inferredcites →https://doi.org/10.1016/j.jctb.2012.03.001openalex-snapshot
From the plane to higher surfaces
inferredcites →https://doi.org/10.1016/j.jctb.2013.10.002openalex-snapshot
Defective 2-colorings of sparse graphs
inferredcites →https://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferredcites →https://doi.org/10.1016/s0012-365x(02)00300-xopenalex-snapshot
Defective choosability results for outerplanar and related graphs
inferredcites →https://doi.org/10.1016/s0012-365x(03)00060-8openalex-snapshot
Improper choosability of graphs embedded on the surface of genus r
inferredcites →https://doi.org/10.1016/s0012-365x(99)00145-4openalex-snapshot
List improper colorings of planar graphs with prescribed girth
inferredcites →https://doi.org/10.1016/s0012-365x(99)00278-2openalex-snapshot
Variations on Ringel's earth–moon problem
inferredcites →https://doi.org/10.1016/s0095-8956(02)00006-0openalex-snapshot
Partitioning into graphs with only small components
inferredcites →https://doi.org/10.1016/s0167-5060(08)70374-1openalex-snapshot
A Survey of (m, k)-Colorings
inferredcites →https://doi.org/10.1016/s0167-5060(08)70470-9openalex-snapshot
On a Problem upon Configurations Contained in Graphs with Given Chromatic Number
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1016/s0893-9659(00)00147-6openalex-snapshot
A note on list improper coloring planar graphs
inferredcites →https://doi.org/10.1017/cbo9780511662072.014openalex-snapshot
Hereditary properties and P-chromatic numbers
inferredcites →https://doi.org/10.1017/s0305004100061521openalex-snapshot
An extremal function for contractions of graphs
inferredcites →https://doi.org/10.1017/s0963548308009462openalex-snapshot
A Weakening of the Odd Hadwiger's Conjecture
inferredcites →https://doi.org/10.1017/s0963548309009663openalex-snapshot
Deciding Relaxed Two-Colourability: A Hardness Jump
inferredcites →https://doi.org/10.1017/s0963548309990216openalex-snapshot
The t-Improper Chromatic Number of Random Graphs
inferredcites →https://doi.org/10.1017/s0963548399003752openalex-snapshot
List Improper Colourings of Planar Graphs
inferredcites →https://doi.org/10.1080/0025570x.1993.11996124openalex-snapshot
Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
inferredcites →https://doi.org/10.1090/conm/147/01167openalex-snapshot
A survey of linkless embeddings
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1065053-0openalex-snapshot
A Separator Theorem for Nonplanar Graphs
inferredcites →https://doi.org/10.1090/trans2/132/03openalex-snapshot
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
inferredcites →https://doi.org/10.1112/jlms.12127openalex-snapshot
Improper colourings inspired by Hadwiger's conjecture
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1134/s0037446611050041openalex-snapshot
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/06066093xopenalex-snapshot
On $(3,1)^*$-Coloring of Plane Graphs
inferredcites →https://doi.org/10.1137/120885140openalex-snapshot
Improper Choosability of Planar Graphs without 4-Cycles
inferredcites →https://doi.org/10.1137/141002177openalex-snapshot
A Relative of Hadwiger's Conjecture
inferredcites →https://doi.org/10.1137/16m1062879openalex-snapshot
Structure of Graphs with Locally Restricted Crossings
inferredcites →https://doi.org/10.1137/s0895480194272183openalex-snapshot
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
inferredcites →https://doi.org/10.1142/s021821650700552xopenalex-snapshot
SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
inferredcites →https://doi.org/10.1515/crll.1989.394.180openalex-snapshot
On the total coloring of planar graphs.
inferredcites →https://doi.org/10.21136/mb.2016.0013-14openalex-snapshot
On subgraphs without large components
inferredcites →https://doi.org/10.37236/181openalex-snapshot
Defective Choosability of Graphs without Small Minors
inferredcites →https://doi.org/10.37236/5715openalex-snapshot
Cliques in Graphs Excluding a Complete Graph Minor
inferredcites →https://doi.org/10.46298/dmtcs.4926openalex-snapshot
Defective Coloring on Classes of Perfect Graphs
inferredcites →https://doi.org/10.48550/arxiv.1304.5468openalex-snapshot
On triangles in K_r-minor free graphs
inferredcites →https://doi.org/10.48550/arxiv.1703.08235openalex-snapshot
Forcing clique immersions through chromatic number
inferredcites →https://doi.org/10.48550/arxiv.1710.02727openalex-snapshot
Islands in minor-closed classes. I. Bounded treewidth and separators
inferredcites →https://doi.org/10.48550/arxiv.cs/0207082openalex-snapshot
Dynamic Generators of Topologically Embedded Graphs
inferredcites →https://doi.org/10.5209/rev_rema.2007.v20.n2.16496openalex-snapshot
Primitive Spatial Graphs and Graph Minors
inferredcites →https://doi.org/10.7151/dmgt.1557openalex-snapshot
Defective choosability of graphs in surfaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22817openalex-snapshot
Decomposing planar graphs into graphs with degree restrictions
inferred← citeshttps://doi.org/10.1002/jgt.22862openalex-snapshot
Polynomial bounds for chromatic number. III. Excluding a double star
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_30openalex-snapshot
Private Graph Colouring with Limited Defectiveness
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_13openalex-snapshot
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02973-yopenalex-snapshot
Sparse Critical Graphs for Defective (1, 3)-Coloring
inferred← citeshttps://doi.org/10.1007/s00454-022-00478-6openalex-snapshot
Three-Dimensional Graph Products with Unbounded Stack-Number
inferred← citeshttps://doi.org/10.1007/s00493-024-00081-8openalex-snapshot
Defective Coloring is Perfect for Minors
inferred← citeshttps://doi.org/10.1007/s00493-025-00168-wopenalex-snapshot
The Grid-Minor Theorem Revisited
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128584openalex-snapshot
A note on decomposing graphs to locally almost irregular subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.03.005openalex-snapshot
The interval coloring impropriety of planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.017openalex-snapshot
Cops and robbers on multi-layer graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112637openalex-snapshot
Defective DP-colorings of sparse simple graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113899openalex-snapshot
Sparse critical graphs for defective DP-colorings
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114696openalex-snapshot
A reduction of the “cycles plus K4's” problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103217openalex-snapshot
On 2-defective DP-colorings of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103267openalex-snapshot
Defective DP-colorings of sparse multigraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103508openalex-snapshot
Distance r -domination number and r -independence complexes of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103730openalex-snapshot
Clustered coloring of graphs with bounded layered treewidth and bounded degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103845openalex-snapshot
Weak diameter coloring of graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103714openalex-snapshot
Computational complexity of covering multigraphs with semi-edges: Small cases
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.08.003openalex-snapshot
Isomorphic bisections of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.09.002openalex-snapshot
Clustered variants of Hajós' conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.02.001openalex-snapshot
Clustered coloring of (path + 2K1)-free graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.005openalex-snapshot
Weak diameter choosability of graphs with an excluded minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.08.001openalex-snapshot
Clustered coloring of graphs excluding a subgraph and a minor
inferred← citeshttps://doi.org/10.1017/s0963548318000548openalex-snapshot
Improper colouring of graphs with no odd clique minor
inferred← citeshttps://doi.org/10.1017/s0963548319000063openalex-snapshot
Defective and clustered choosability of sparse graphs
inferred← citeshttps://doi.org/10.1017/s0963548321000213openalex-snapshot
Clustered 3-colouring graphs of bounded degree
inferred← citeshttps://doi.org/10.1017/s0963548322000165openalex-snapshot
Clustered colouring of graph classes with bounded treedepth or pathwidth
inferred← citeshttps://doi.org/10.1017/s0963548322000268openalex-snapshot
Improved bound for improper colourings of graphs with no odd clique minor
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1088/1742-6596/1188/1/012002openalex-snapshot
On the Nordhaus-Gaddum problem for 3-defective colorings of P4-free graphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00116openalex-snapshot
Proof of the Clustered Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1137/1.9781611976465.119openalex-snapshot
Asymptotic dimension of minor-closed families and beyond
inferred← citeshttps://doi.org/10.1155/2021/5540604openalex-snapshot
On the k -Component Independence Number of a Tree
inferred← citeshttps://doi.org/10.26180/5c4bf752cadd9openalex-snapshot
Extremal Graph Theory for Minors, Improper Colourings and Gonality
inferred← citeshttps://doi.org/10.37236/11049openalex-snapshot
Vizing's and Shannon's Theorems for Defective Edge Colouring
inferred← citeshttps://doi.org/10.37236/7693openalex-snapshot
On Generalized Choice and Coloring Numbers
inferred← citeshttps://doi.org/10.37236/8909openalex-snapshot
On Fractional Fragility Rates of Graph Classes
inferred← citeshttps://doi.org/10.4171/jems/1341openalex-snapshot
Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06149openalex-snapshot
A note on choosability with defect 1 of graphs on surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.1905.08969openalex-snapshot
Clustered Graph Coloring and Layered Treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.2001.05448openalex-snapshot
Higher Independence Complexes of graphs and their homotopy types
inferred← citeshttps://doi.org/10.48550/arxiv.2007.03582openalex-snapshot
Surfaces have (asymptotic) dimension 2
inferred← citeshttps://doi.org/10.5753/etc.2020.11085openalex-snapshot
(Star, k)-colourings of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.