On the public citation graph

An upper bound for the total chromatic number

https://doi.org/10.1007/bf01787726
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.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1007/bf02582936openalex-snapshot
List-colourings of graphs
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.1112/jlms/s1-42.1.226openalex-snapshot
The Colour Numbers of Complete Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-9.2.279openalex-snapshot
Nombre Chromatique Total Du Graphe R -Parti Complet

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.1002/jgt.3190130112openalex-snapshot
A note on list‐colorings
inferred← citeshttps://doi.org/10.1002/jgt.3190160302openalex-snapshot
An upper bound for the total chromatic number of dense graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190160510openalex-snapshot
Some upper bounds on the total and list chromatic numbers of multigraphs
inferred← citeshttps://doi.org/10.1007/978-1-0716-3597-1_17openalex-snapshot
Edge Chromatic Number of a Graph
inferred← citeshttps://doi.org/10.1007/978-1-4613-3554-2_2openalex-snapshot
Some Problems in Total Graph Theory
inferred← citeshttps://doi.org/10.1007/bf01303515openalex-snapshot
Fractionally colouring total graphs
inferred← citeshttps://doi.org/10.1007/s10255-021-1039-3openalex-snapshot
Total-coloring of Sparse Graphs with Maximum Degree 6
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90602-copenalex-snapshot
List edge chromatic number of graphs with large girth
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(93)90175-sopenalex-snapshot
An upper bound for total colouring of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90329-ropenalex-snapshot
The total chromatic number of graphs having large maximum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00219-9openalex-snapshot
A new upper bound for total colourings of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90162-7openalex-snapshot
Recent developments in total colouring
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90255-0openalex-snapshot
The total chromatic number of regular graphs whose complement is bipartite
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00286-6openalex-snapshot
The total chromatic number of any multigraph with maximum degree five is at most seven
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90085-xopenalex-snapshot
The total chromatic number of nearly complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00013-7openalex-snapshot
Extending fixed vertex-colourings to total colourings
inferred← citeshttps://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferred← citeshttps://doi.org/10.1017/s0963548300001899openalex-snapshot
An Improvement of Hind's Upper Bound on the Total Chromatic Number
inferred← citeshttps://doi.org/10.1023/a:1022864000162openalex-snapshot
Special Classes of Snarks
inferred← citeshttps://doi.org/10.1137/s0097539795294578openalex-snapshot
Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
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.37236/11032openalex-snapshot
Weak Total Coloring Conjecture and Hadwiger’s Conjecture on Total Graphs
inferred← citeshttps://doi.org/10.70675/22dd7305zb552z431fza392zbc8e233f69dfopenalex-snapshot
Induction Schemes : From Language Separation to Graph Colorings
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.