On the public citation graph

Total colorings of graphs of order 2n having maximum degree 2n−2

https://doi.org/10.1007/bf02350630
0 signed · 21 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.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02771690openalex-snapshot
On the total coloring of certain graphs
inferredcites →https://doi.org/10.1016/0012-365x(77)90146-7openalex-snapshot
The total coloring of a multigraph with maximal degree 4
inferredcites →https://doi.org/10.1016/0012-365x(90)90031-copenalex-snapshot
A total-chromatic number analogue of plantholt's theorem
inferredcites →https://doi.org/10.1017/s1446788700033176openalex-snapshot
Total chromatic number of graphs of high degree
inferredcites →https://doi.org/10.1017/s1446788700035801openalex-snapshot
Total chromatic number of graphs of high degree, II
inferredcites →https://doi.org/10.1112/blms/21.2.159openalex-snapshot
Total Colourings of Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-42.1.226openalex-snapshot
The Colour Numbers of Complete Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032497.ch4openalex-snapshot
Degrees
inferred← citeshttps://doi.org/10.1006/jctb.1999.1902openalex-snapshot
Totally Critical Even Order Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52213-0_19openalex-snapshot
On Total Chromatic Number of Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90167-ropenalex-snapshot
Recent results on the total chromatic number
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00291-popenalex-snapshot
Generalization of two results of Hilton on total-colourings of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.050openalex-snapshot
Total colorings of complete multipartite graphs using amalgamations
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.027openalex-snapshot
On total chromatic number of complete multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.325openalex-snapshot
Strong conformable coloring: the conformable coloring for Type 1 graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00049-9openalex-snapshot
The total chromatic number of graphs of even order and high degree
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00034-5openalex-snapshot
Total chromatic number of graphs of odd order and high degree
inferred← citeshttps://doi.org/10.11650/tjm/220105openalex-snapshot
On Total Coloring of Some Classes of Regular Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1812.05833openalex-snapshot
Total Colourings - A survey
inferred← citeshttps://doi.org/10.48550/arxiv.1910.03922openalex-snapshot
Total Coloring of some classes of Powers of Cycles
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.