On the public citation graph

Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph

https://doi.org/10.37236/9455
0 signed · 32 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.10069openalex-snapshot
Edge‐partitions of planar graphs and their game coloring numbers
inferredcites →https://doi.org/10.1002/jgt.21711openalex-snapshot
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
inferredcites →https://doi.org/10.1002/jgt.21846openalex-snapshot
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
inferredcites →https://doi.org/10.1002/jgt.22000openalex-snapshot
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
inferredcites →https://doi.org/10.1002/jgt.22518openalex-snapshot
Toward Cereceda's conjecture for planar graphs
inferredcites →https://doi.org/10.1002/jgt.3190140108openalex-snapshot
On the linear vertex‐arboricity of a planar graph
inferredcites →https://doi.org/10.1007/3-540-33700-8_25openalex-snapshot
Recent Developments in Circular Colouring of Graphs
inferredcites →https://doi.org/10.1007/bf02760181openalex-snapshot
The point-arboricity of a graph
inferredcites →https://doi.org/10.1007/s004930050001openalex-snapshot
Partitioning Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1016/j.amc.2018.01.003openalex-snapshot
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
inferredcites →https://doi.org/10.1016/j.disc.2017.06.014openalex-snapshot
Maximum average degree and relaxed coloring
inferredcites →https://doi.org/10.1016/j.ejc.2007.06.020openalex-snapshot
Decomposing a planar graph with girth 9 into a forest and a matching
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.022openalex-snapshot
On the vertex-arboricity of planar graphs
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.2015.05.003openalex-snapshot
Decomposing a graph into pseudoforests with one having bounded degree
inferredcites →https://doi.org/10.1016/j.jctb.2020.07.001openalex-snapshot
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true
inferredcites →https://doi.org/10.1016/j.jctb.2020.11.001openalex-snapshot
Reconfiguring colorings of graphs with bounded maximum average degree
inferredcites →https://doi.org/10.1016/j.jctb.2022.01.006openalex-snapshot
A polynomial version of Cereceda's conjecture
inferredcites →https://doi.org/10.1016/s0012-365x(00)00447-7openalex-snapshot
Minimal reducible bounds for the class of k-degenerate graphs
inferredcites →https://doi.org/10.1111/j.1467-9590.2009.00468.xopenalex-snapshot
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
inferredcites →https://doi.org/10.1112/blms/11.2.113openalex-snapshot
Optimal Vertex Partitions
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/21m1392280openalex-snapshot
Vertex Partitions into an Independent Set and a Forest with Each Component Small
inferredcites →https://doi.org/10.37236/6815openalex-snapshot
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
inferredcites →https://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferredcites →https://doi.org/10.48550/arxiv.1810.00731openalex-snapshot
Towards Cereceda's conjecture for planar graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4877057openalex-extracted
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1002/jgt.70119openalex-snapshot
Nordhaus–Gaddum‐Type Theorems for Maximum Average Degree
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_2openalex-snapshot
Distributed Algorithms for Fractional Coloring
inferred← citeshttps://doi.org/10.1007/s00013-024-01998-8openalex-snapshot
Combinatorial upper bounds for the smallest eigenvalue of a graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103635openalex-snapshot
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1112/plms.70013openalex-snapshot
Resolution of the Kohayakawa–Kreuter conjecture
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.