On the public citation graph
On the maximum average degree and the incidence chromatic number of a graph
0 signed · 40 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/(sici)1097-0118(199704)24:4<331::aid-jgt5>3.3.co;2-8openalex-snapshot
Acyclic and oriented chromatic numbers of graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199707)25:3<191::aid-jgt3>3.3.co;2-bopenalex-snapshot
The chromatic number of oriented graphs
inferredcites →https://doi.org/10.1007/bf02124683openalex-snapshot
Ahypergraph-free construction of highly chromatic graphs without short cycles
inferredcites →https://doi.org/10.1016/0012-365x(76)90075-3openalex-snapshot
Note to the paper of Grünbaum on acyclic colorings
inferredcites →https://doi.org/10.1016/0012-365x(89)90073-3openalex-snapshot
The star arboricity of graphs
inferredcites →https://doi.org/10.1016/0012-365x(93)90286-3openalex-snapshot
Incidence and strong edge colorings of graphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00342-topenalex-snapshot
On incidence coloring and star arboricity of graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)00088-3openalex-snapshot
Good and semi-strong colorings of oriented planar graphs
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/j.disc.2004.01.015openalex-snapshot
Incidence coloring of k-degenerated graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.02.003openalex-snapshot
The incidence coloring conjecture for graphs of maximum degree 3
inferredcites →https://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/s0012-365x(01)00302-8openalex-snapshot
The incidence coloring number of Halin graphs and outerplanar graphs
inferredcites →https://doi.org/10.1016/s0012-365x(01)00457-5openalex-snapshot
On incidence coloring for some cubic graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00198-7openalex-snapshot
Colorings and girth of oriented planar graphs
inferredcites →https://doi.org/10.1016/s0012-365x(98)00393-8openalex-snapshot
On the maximum average degree and the oriented chromatic number of a graph
inferredcites →https://doi.org/10.1016/s0167-5060(08)70561-2openalex-snapshot
The Star Arboricity of Graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1090/s0002-9947-96-01537-1openalex-snapshot
Duality and Polynomial Testing of Tree Homomorphisms
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.21782openalex-snapshot
2‐Distance Coloring of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_10openalex-snapshot
Incidence Coloring Game and Arboricity of Graphs
inferred← citeshttps://doi.org/10.1007/s10255-024-1126-3openalex-snapshot
Incidence Coloring of Outer-1-planar Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.007openalex-snapshot
Interval incidence coloring of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.029openalex-snapshot
Incidence coloring of graphs with high maximum average degree
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.011openalex-snapshot
Coloring squares of graphs with mad constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113311openalex-snapshot
Hypergraph incidence coloring
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.027openalex-snapshot
2-distance coloring of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2014.10.001openalex-snapshot
The incidence game chromatic number of (a,d) -decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.026openalex-snapshot
Incidence coloring of Mycielskians with fast algorithm
inferred← citeshttps://doi.org/10.11650/twjm/1500406852openalex-snapshot
INCIDENCE COLORING OF REGULAR GRAPHS AND COMPLEMENT GRAPHS
inferred← citeshttps://doi.org/10.37236/10898openalex-snapshot
Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6145openalex-snapshot
Incidence coloring of Regular graphs and Complement graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1663openalex-snapshot
The incidence chromatic number of toroidal grids
inferred← citeshttps://doi.org/10.7151/dmgt.1962openalex-snapshot
Interval incidence coloring of subcubic graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1995openalex-snapshot
On incidence coloring of complete multipartite and semicubic bipartite graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2050openalex-snapshot
Facial incidence colorings of embedded multigraphs
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.