On the public citation graph

Fractionally colouring total graphs

https://doi.org/10.1007/bf01303515
0 signed · 31 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/bf01787726openalex-snapshot
An upper bound for the total chromatic number
inferredcites →https://doi.org/10.1016/0095-8956(72)90032-9openalex-snapshot
Anti-blocking polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(90)90073-lopenalex-snapshot
Fractional total colouring
inferredcites →https://doi.org/10.1070/rm1968v023n06abeh001252openalex-snapshot
SOME UNSOLVED PROBLEMS IN GRAPH THEORY
inferredcites →https://doi.org/10.1112/jlms/s2-3.3.405openalex-snapshot
On Total Chromatic Number of a Graph
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jctb.1996.0001openalex-snapshot
A Class of Matchings and a Related Lattice
inferred← citeshttps://doi.org/10.1007/pl00009820openalex-snapshot
A Bound on the Total Chromatic Number
inferred← citeshttps://doi.org/10.1007/s10898-013-0138-yopenalex-snapshot
Minimum total coloring of planar graph
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.052openalex-snapshot
Fractionally total colouring Gn,p
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.070openalex-snapshot
Total and fractional total colourings of circulant graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.09.012openalex-snapshot
(P,Q) -Total (r,s) -colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.06.001openalex-snapshot
On topological relaxations of chromatic conjectures
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.039openalex-snapshot
A Characterization of Graphs with Fractional Total Chromatic Number Equal to
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.12.005openalex-snapshot
Fractional total colourings of graphs of high girth
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.07.002openalex-snapshot
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
inferred← citeshttps://doi.org/10.1090/crmp/023openalex-snapshot
Graph Colouring and Applications
inferred← citeshttps://doi.org/10.1137/090779097openalex-snapshot
The Last Fraction of a Fractional Conjecture
inferred← citeshttps://doi.org/10.1137/s0097539795294578openalex-snapshot
Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
inferred← citeshttps://doi.org/10.1201/b16132-20openalex-snapshot
Connectivity
inferred← citeshttps://doi.org/10.1201/b16132-30openalex-snapshot
Further Topics in Graph Coloring
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.4236/ojdm.2013.33029openalex-snapshot
Multiple Circular Colouring as a Model for Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2808openalex-snapshot
Fractional total colourings of graphs of high girth
inferred← citeshttps://doi.org/10.70675/cae60fe0z49d9z4c30za6f1z76158ca58aa5openalex-snapshot
Coloration de graphes épars
inferred← citeshttps://doi.org/10.7151/dmgt.1649openalex-snapshot
Fractional ({ P},{ Q})-total list colorings of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1685openalex-snapshot
Fractional Q-coloring of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1697openalex-snapshot
Generalized fractional total coloring of complete graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1810openalex-snapshot
Generalized fractional total colorings of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1812openalex-snapshot
Generalized fractional and circular total colorings of graphs
inferred← citeshttps://doi.org/10.82308/54428openalex-snapshot
Fractional edge and total colouring
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.