On the public citation graph

The incidence chromatic number of toroidal grids

https://doi.org/10.7151/dmgt.1663
0 signed · 28 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.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/j.camwa.2004.02.006openalex-snapshot
The incidence coloring numbers of meshes
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.2007.03.076openalex-snapshot
NP-completeness of 4-incidence colorability of semi-cubic graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.11.030openalex-snapshot
Invalid proofs on incidence coloring
inferredcites →https://doi.org/10.1016/j.disc.2007.11.047openalex-snapshot
Incidence coloring of the squares of some graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.10.027openalex-snapshot
Some results on the incidence coloring number of a graph
inferredcites →https://doi.org/10.1016/j.disc.2010.05.011openalex-snapshot
Coloring the square of the Cartesian product of two cycles
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(04)00151-7openalex-snapshot
Incidence coloring of k-degenerated graphs
inferredcites →https://doi.org/10.1016/s0020-0190(03)00232-1openalex-snapshot
Acyclic and k-distance coloring of the grid
inferredcites →https://doi.org/10.1016/s0167-5060(08)70561-2openalex-snapshot
The Star Arboricity of Graphs
inferredcites →https://doi.org/10.46298/dmtcs.349openalex-snapshot
On the maximum average degree and the incidence chromatic number of a graph

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.030openalex-snapshot
On incidence coloring conjecture in Cartesian products of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.027openalex-snapshot
Incidence choosability of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.017openalex-snapshot
Strong incidence coloring of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.03.004openalex-snapshot
On incidence choosability of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.002openalex-snapshot
Incidence coloring of Cartesian product 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.1109/bdacs53596.2021.00042openalex-snapshot
Incidence Coloring of Product Graphs of Paths
inferred← citeshttps://doi.org/10.19113/sdufbed.96828openalex-snapshot
Genelleştirilmiş Fibonacci Çizgelerin Bazı Özellikleri
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-6openalex-snapshot
A Study of $k$-dipath Colourings of Oriented Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04908openalex-snapshot
On incidence coloring conjecture in Cartesian products of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2466openalex-snapshot
Strong incidence colouring of graphs
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.