On the public citation graph
On the total coloring of certain graphs
0 signed · 131 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.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
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/(sici)1097-0118(199709)26:1<53::aid-jgt6>3.0.co;2-gopenalex-snapshot
Total colorings of planar graphs with large maximum degree
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199905)31:1<67::aid-jgt6>3.0.co;2-copenalex-snapshot
On total 9-coloring planar graphs of maximum degree seven
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199911)32:3<250::aid-jgt5>3.0.co;2-ropenalex-snapshot
Graphs of degree 4 are 5-edge-choosable
inferred← citeshttps://doi.org/10.1002/jgt.20124openalex-snapshot
(d,1)‐total labeling of graphs with a given maximum average degree
inferred← citeshttps://doi.org/10.1002/jgt.20195openalex-snapshot
Total chromatic number of planar graphs with maximum degree ten
inferred← citeshttps://doi.org/10.1002/jgt.22125openalex-snapshot
Generation of Cubic Graphs and Snarks with Large Girth
inferred← citeshttps://doi.org/10.1002/jgt.3190160608openalex-snapshot
Total chromatic number of complete r‐partite graphs
inferred← citeshttps://doi.org/10.1006/eujc.1997.0152openalex-snapshot
Total Colourings of Planar Graphs with Large Girth
inferred← citeshttps://doi.org/10.1006/jctb.1997.1780openalex-snapshot
List Edge and List Total Colourings of Multigraphs
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_9openalex-snapshot
Coloring Algorithms on Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
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/978-3-030-57602-8_42openalex-snapshot
Total Coloring of Outer-1-planar Graphs: The Cold Case
inferred← citeshttps://doi.org/10.1007/978-3-031-16081-3_37openalex-snapshot
Total Coloring of Planar Graphs Without Some Adjacent Cycles
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_53openalex-snapshot
Some Results on List Total Colorings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_6openalex-snapshot
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
inferred← citeshttps://doi.org/10.1007/978-981-33-4073-2_15openalex-snapshot
Relation Between Perfect Colouring and Chromatic Number for Snake Graph Family
inferred← citeshttps://doi.org/10.1007/bf01473611openalex-snapshot
Just two total graphs are complementary
inferred← citeshttps://doi.org/10.1007/bf01787726openalex-snapshot
An upper bound for the total chromatic number
inferred← citeshttps://doi.org/10.1007/bf02350630openalex-snapshot
Total colorings of graphs of order 2n having maximum degree 2n−2
inferred← citeshttps://doi.org/10.1007/s00224-012-9410-7openalex-snapshot
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds
inferred← citeshttps://doi.org/10.1007/s00373-008-0778-8openalex-snapshot
Total Colorings of Planar Graphs without Small Cycles
inferred← citeshttps://doi.org/10.1007/s00373-013-1399-4openalex-snapshot
On the Total-Neighbor-Distinguishing Index by Sums
inferred← citeshttps://doi.org/10.1007/s00373-015-1617-3openalex-snapshot
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
inferred← citeshttps://doi.org/10.1007/s003730200051openalex-snapshot
Equitable Total Coloring of Graphs with Maximum Degree 3
inferred← citeshttps://doi.org/10.1007/s10114-016-5480-9openalex-snapshot
A totally (Δ + 1)-colorable 1-planar graph with girth at least five
inferred← citeshttps://doi.org/10.1007/s10255-017-0667-0openalex-snapshot
On total colorings of some special 1-planar 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.1007/s10878-012-9470-2openalex-snapshot
L(2,1)-labelings of the edge-path-replacement of a graph
inferred← citeshttps://doi.org/10.1007/s10878-012-9487-6openalex-snapshot
L(d,1)-labelings of the edge-path-replacement of a graph
inferred← citeshttps://doi.org/10.1007/s10878-013-9641-9openalex-snapshot
On total colorings of 1-planar graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9859-9openalex-snapshot
Total coloring of planar graphs without short cycles
inferred← citeshttps://doi.org/10.1007/s10878-016-0025-9openalex-snapshot
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
inferred← citeshttps://doi.org/10.1007/s10878-018-00375-wopenalex-snapshot
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
inferred← citeshttps://doi.org/10.1007/s10878-021-00816-zopenalex-snapshot
On total and edge coloring some Kneser graphs
inferred← citeshttps://doi.org/10.1007/s11425-008-0153-5openalex-snapshot
Adjacent strong edge colorings and total colorings of regular graphs
inferred← citeshttps://doi.org/10.1007/s11425-010-0089-4openalex-snapshot
Total coloring of embedded graphs of maximum degree at least ten
inferred← citeshttps://doi.org/10.1007/s11425-010-3089-5openalex-snapshot
Total coloring of embedded graphs of maximum degree at least ten
inferred← citeshttps://doi.org/10.1007/s11425-013-4576-2openalex-snapshot
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
inferred← citeshttps://doi.org/10.1007/s11434-007-2031-xopenalex-snapshot
On total chromatic number of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1007/s11464-013-0322-xopenalex-snapshot
Neighbor sum distinguishing total colorings of K 4-minor free graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90146-7openalex-snapshot
The total coloring of a multigraph with maximal degree 4
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(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/j.aml.2009.03.009openalex-snapshot
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.025openalex-snapshot
Total coloring of planar graphs without 6-cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2011.01.001openalex-snapshot
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.024openalex-snapshot
Total chromatic number of unichord-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.016openalex-snapshot
Complexity of colouring problems restricted to unichord-free and { square,unichord }-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.006openalex-snapshot
The hunting of a snark with total chromatic number 5
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.013openalex-snapshot
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.013openalex-snapshot
On the equitable total chromatic number of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.019openalex-snapshot
L(p,q) -labelings of subdivisions of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.012openalex-snapshot
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.059openalex-snapshot
(d,1) -total labelling of planar graphs with large girth and high maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.006openalex-snapshot
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.008openalex-snapshot
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.013openalex-snapshot
The total-chromatic number of some families of snarks
inferred← citeshttps://doi.org/10.1016/j.disc.2014.09.006openalex-snapshot
L(2,1) -labelings of subdivisions of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.011openalex-snapshot
Facial entire colouring of plane graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.010openalex-snapshot
On the total coloring of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.024openalex-snapshot
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111654openalex-snapshot
Edge coloring signed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112014openalex-snapshot
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114896openalex-snapshot
A sufficient condition for complete multipartite graphs to be of Type 1
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.2005.06.082openalex-snapshot
The total chromatic number of some bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.085openalex-snapshot
Total chromatic number of {square,unichord}-free graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.009openalex-snapshot
On Coloring Problems of Snark Families
inferred← citeshttps://doi.org/10.1016/j.endm.2016.05.016openalex-snapshot
Total Coloring of Certain Classes of Product Graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.003openalex-snapshot
-total-colorability of plane graphs with maximum degree Δ at least 6 and without adjacent short cycles
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.05.006openalex-snapshot
-total-colorability of plane graphs of maximum degree with neither chordal 5-cycle nor chordal 6-cycle
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.06.003openalex-snapshot
A concise proof for total coloring subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.02.006openalex-snapshot
Entire colouring of plane graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.05.001openalex-snapshot
Generation and properties of snarks
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.038openalex-snapshot
On total coloring the direct product of complete graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.041openalex-snapshot
On equitable total coloring of snarks
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.235openalex-snapshot
Kochol superposition of Goldberg with Semi-blowup snarks is Type 1
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.299openalex-snapshot
Type 1 and Type 2 Kochol superposition snarks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.030openalex-snapshot
Total coloring of embedded graphs with maximum degree at least seven
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.024openalex-snapshot
Total coloring of recursive maximal planar graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00160-xopenalex-snapshot
A study of the total chromatic number of equibipartite graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00091-5openalex-snapshot
Total chromatic number of graphs with small genus
inferred← citeshttps://doi.org/10.1017/s0963548397003210openalex-snapshot
List Total Colourings of Graphs
inferred← citeshttps://doi.org/10.1017/s1446788700033176openalex-snapshot
Total chromatic number of graphs of high degree
inferred← citeshttps://doi.org/10.1017/s1446788700035801openalex-snapshot
Total chromatic number of graphs of high degree, II
inferred← citeshttps://doi.org/10.1051/ro/2023129openalex-snapshot
On total coloring and equitable total coloring of infinite snark families
inferred← citeshttps://doi.org/10.1051/ro/2023140openalex-snapshot
On the conformability of regular line graphs
inferred← citeshttps://doi.org/10.1051/ro/2024045openalex-snapshot
On the total chromatic number of the direct product of cycles and complete graphs
inferred← citeshttps://doi.org/10.1080/09720529.2019.1677309openalex-snapshot
Total chromatic number of honeycomb network
inferred← citeshttps://doi.org/10.1080/23799927.2024.2324255openalex-snapshot
Chromatic numbers of certain hypercube variants
inferred← citeshttps://doi.org/10.1088/1742-6596/1663/1/012024openalex-snapshot
Perfect colouring of the graph with its kinds
inferred← citeshttps://doi.org/10.1112/s0024610799007668openalex-snapshot
On the Total Coloring of Graphs Embeddable in Surfaces
inferred← citeshttps://doi.org/10.1137/070688389openalex-snapshot
Total-Coloring of Plane Graphs with Maximum Degree Nine
inferred← citeshttps://doi.org/10.1142/s0129054104002285openalex-snapshot
COLORING ALGORITHMS ON SUBCUBIC GRAPHS
inferred← citeshttps://doi.org/10.1142/s1793830918500416openalex-snapshot
Coloring 3-power of 3-subdivision of subcubic graph
inferred← citeshttps://doi.org/10.1142/s1793830921500609openalex-snapshot
Total coloring of quasi-line graphs and inflated graphs
inferred← citeshttps://doi.org/10.12988/ams.2015.5121openalex-snapshot
Total coloring algorithm for graphs
inferred← citeshttps://doi.org/10.18297/etd/815openalex-snapshot
A study of the total coloring of graphs.
inferred← citeshttps://doi.org/10.21711/231766362012/rmc4213openalex-snapshot
Total chromatic number of some families of graphs with maximum degree 3
inferred← citeshttps://doi.org/10.21711/231766362015/rmc446openalex-snapshot
Total coloring of snarks is NP-complete
inferred← citeshttps://doi.org/10.21711/231766362021/rmc4811openalex-snapshot
On total coloring of a Superposition snark family
inferred← citeshttps://doi.org/10.26493/1855-3974.1601.e75openalex-snapshot
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
inferred← citeshttps://doi.org/10.26493/1855-3974.751.9a8openalex-snapshot
Distinguishing graphs by total colourings
inferred← citeshttps://doi.org/10.28919/10.28919/jmcs/5397openalex-snapshot
PCCP of wheel graph family with null, chain, fan and cycle graph
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3411openalex-snapshot
Coloring Graphs Drawn with Crossings
inferred← citeshttps://doi.org/10.3233/jifs-182816openalex-snapshot
A genetic algorithm for total graph coloring
inferred← citeshttps://doi.org/10.3384/9789179292119openalex-snapshot
Edge Precoloring Extension of Trees
inferred← citeshttps://doi.org/10.3390/math10060912openalex-snapshot
Total Coloring of Dumbbell Maximal Planar 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.37236/11032openalex-snapshot
Weak Total Coloring Conjecture and Hadwiger’s Conjecture on Total Graphs
inferred← citeshttps://doi.org/10.4236/jamp.2024.127161openalex-snapshot
On the (Δ + 2)-Total-Colorability of Planar Graphs with 7-Cycles Containing at Most Two Chords
inferred← citeshttps://doi.org/10.48550/arxiv.1010.2989openalex-snapshot
Interval total colorings of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0622openalex-snapshot
Minimal counterexamples and discharging method
inferred← citeshttps://doi.org/10.5614/ejgta.2023.11.1.18openalex-snapshot
Total coloring conjecture on certain classes of product graphs
inferred← citeshttps://doi.org/10.5753/etc.2022.222599openalex-snapshot
Um estudo sobre emparelhamentos e a coloração total
inferred← citeshttps://doi.org/10.5753/etc.2024.2072openalex-snapshot
Infinite families of Kochol superpositions of Goldberg with Blowup snarks are Type 2
inferred← citeshttps://doi.org/10.5753/etc.2024.2115openalex-snapshot
Coloração total equilibrada do snark Estrela Dupla
inferred← citeshttps://doi.org/10.5753/etc.2026.23571openalex-snapshot
On the conformability of the disjoint union of graphs
inferred← citeshttps://doi.org/10.70675/22dd7305zb552z431fza392zbc8e233f69dfopenalex-snapshot
Induction Schemes : From Language Separation to Graph Colorings
inferred← citeshttps://doi.org/10.7151/dmgt.1438openalex-snapshot
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
inferred← citeshttps://doi.org/10.7151/dmgt.2300openalex-snapshot
Total coloring of claw-free planar graphs
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/14231openalex-snapshot
Overview of Graph Colouring and some Ramsey-type Numbers
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.