On the public citation graph
Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)
0 signed · 157 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.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
inferredcites →https://doi.org/10.1002/1098-2418(200009)17:2<117::aid-rsa3>3.0.co;2-9openalex-snapshot
Asymptotics of the list-chromatic index for multigraphs
inferredcites →https://doi.org/10.1002/jgt.20195openalex-snapshot
Total chromatic number of planar graphs with maximum degree ten
inferredcites →https://doi.org/10.1002/jgt.20273openalex-snapshot
List‐coloring the square of a subcubic graph
inferredcites →https://doi.org/10.1002/jgt.21782openalex-snapshot
2‐Distance Coloring of Sparse Graphs
inferredcites →https://doi.org/10.1002/jgt.21802openalex-snapshot
Counterexamples to the List Square Coloring Conjecture
inferredcites →https://doi.org/10.1002/jgt.22101openalex-snapshot
List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles
inferredcites →https://doi.org/10.1002/jgt.22452openalex-snapshot
On the clique number of the square of a line graph and its relation to maximum degree of the line graph
inferredcites →https://doi.org/10.1002/jgt.22802openalex-snapshot
Strong edge colorings of graphs and the covers of Kneser graphs
inferredcites →https://doi.org/10.1002/jgt.3190170204openalex-snapshot
Induced matchings in cubic graphs
inferredcites →https://doi.org/10.1002/net.3230100109openalex-snapshot
Maximum degree in graphs of diameter 2
inferredcites →https://doi.org/10.1006/eujc.1997.0152openalex-snapshot
Total Colourings of Planar Graphs with Large Girth
inferredcites →https://doi.org/10.1006/jcta.1996.0001openalex-snapshot
Asymptotically Good List-Colorings
inferredcites →https://doi.org/10.1006/jctb.1995.1011openalex-snapshot
The List Chromatic Index of a Bipartite Multigraph
inferredcites →https://doi.org/10.1006/jctb.1997.1724openalex-snapshot
A Bound on the Strong Chromatic Index of a Graph
inferredcites →https://doi.org/10.1006/jctb.1997.1780openalex-snapshot
List Edge and List Total Colourings of Multigraphs
inferredcites →https://doi.org/10.1006/jctb.1998.1891openalex-snapshot
A Strengthening of Brooks' Theorem
inferredcites →https://doi.org/10.1006/jctb.1999.1910openalex-snapshot
Coloring Graphs with Sparse Neighborhoods
inferredcites →https://doi.org/10.1006/jctb.2001.2047openalex-snapshot
Planar Graphs of Maximum Degree Seven are Class I
inferredcites →https://doi.org/10.1007/978-1-349-13908-8_10openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.1007/978-3-030-48966-3_27openalex-snapshot
Between Proper and Strong Edge-Colorings of Subcubic Graphs
inferredcites →https://doi.org/10.1007/978-3-642-04016-0openalex-snapshot
Graph Colouring and the Probabilistic Method
inferredcites →https://doi.org/10.1007/978-3-642-27875-4openalex-snapshot
Sparsity (Graphs, Structures, and Algorithms)
inferredcites →https://doi.org/10.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1007/bf01303515openalex-snapshot
Fractionally colouring total graphs
inferredcites →https://doi.org/10.1007/bf01418933openalex-snapshot
On the difference between consecutive primes
inferredcites →https://doi.org/10.1007/bf01787726openalex-snapshot
An upper bound for the total chromatic number
inferredcites →https://doi.org/10.1007/bf01885700openalex-snapshot
The chromatic class of a multigraph
inferredcites →https://doi.org/10.1007/bf02771690openalex-snapshot
On the total coloring of certain graphs
inferredcites →https://doi.org/10.1007/pl00009820openalex-snapshot
A Bound on the Total Chromatic Number
inferredcites →https://doi.org/10.1007/s00373-014-1449-6openalex-snapshot
Total Coloring of Planar Graphs Without Chordal Short Cycles
inferredcites →https://doi.org/10.1007/s003730070009openalex-snapshot
Every Planar Graph with Maximum Degree 7 Is of Class 1
inferredcites →https://doi.org/10.1007/s00493-013-2573-2openalex-snapshot
A unified approach to distance-two colouring of graphs on surfaces
inferredcites →https://doi.org/10.1007/s00493-019-4014-3openalex-snapshot
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles
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(88)90196-3openalex-snapshot
Problems and results in combinatorial analysis and graph theory
inferredcites →https://doi.org/10.1016/0012-365x(89)90163-5openalex-snapshot
Induced matchings in bipartite graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90144-7openalex-snapshot
The maximum number of edges in 2K2-free graphs of bounded degree
inferredcites →https://doi.org/10.1016/0012-365x(92)90678-9openalex-snapshot
The strong chromatic index of a cubic graph is at most 10
inferredcites →https://doi.org/10.1016/0012-365x(93)90166-qopenalex-snapshot
Largest planar graphs of diameter two and fixed maximum degree
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)00286-6openalex-snapshot
The total chromatic number of any multigraph with maximum degree five is at most seven
inferredcites →https://doi.org/10.1016/0095-8956(77)90037-5openalex-snapshot
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
inferredcites →https://doi.org/10.1016/j.amc.2017.11.057openalex-snapshot
Odd graph and its applications to the strong edge coloring
inferredcites →https://doi.org/10.1016/j.dam.2007.05.061openalex-snapshot
Labelling planar graphs without 4-cycles with a condition on distance two
inferredcites →https://doi.org/10.1016/j.dam.2008.08.024openalex-snapshot
Graph labellings with variable weights, a survey
inferredcites →https://doi.org/10.1016/j.dam.2011.06.015openalex-snapshot
Strong edge colouring of subcubic graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.05.021openalex-snapshot
On strong edge-colouring of subcubic graphs
inferredcites →https://doi.org/10.1016/j.dam.2014.02.004openalex-snapshot
Total colorings of planar graphs without chordal 6-cycles
inferredcites →https://doi.org/10.1016/j.dam.2014.07.006openalex-snapshot
Strong edge-colouring of sparse planar graphs
inferredcites →https://doi.org/10.1016/j.dam.2014.08.004openalex-snapshot
Chromatic-choosability of the power of graphs
inferredcites →https://doi.org/10.1016/j.dam.2017.09.006openalex-snapshot
On strong edge-coloring of graphs with maximum degree 4
inferredcites →https://doi.org/10.1016/j.dam.2019.08.011openalex-snapshot
Coloring squares of graphs with mad constraints
inferredcites →https://doi.org/10.1016/j.dam.2022.07.008openalex-snapshot
Strong edge-coloring of cubic bipartite graphs: A counterexample
inferredcites →https://doi.org/10.1016/j.disc.2005.11.029openalex-snapshot
A survey on labeling graphs with a condition at distance two
inferredcites →https://doi.org/10.1016/j.disc.2006.03.053openalex-snapshot
Strong edge-coloring of graphs with maximum degree 4 using 22 colors
inferredcites →https://doi.org/10.1016/j.disc.2007.07.034openalex-snapshot
A note on the strong chromatic index of bipartite graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.11.051openalex-snapshot
The strong chromatic index of a class of graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.12.100openalex-snapshot
Choosability of the square of planar subcubic graphs with large girth
inferredcites →https://doi.org/10.1016/j.disc.2008.03.024openalex-snapshot
Colouring graphs with bounded generalized colouring number
inferredcites →https://doi.org/10.1016/j.disc.2008.09.017openalex-snapshot
On the existence of graphs of diameter two and defect two
inferredcites →https://doi.org/10.1016/j.disc.2009.11.011openalex-snapshot
The average degree of a multigraph critical with respect to edge or total choosability
inferredcites →https://doi.org/10.1016/j.disc.2010.07.019openalex-snapshot
Brooks’ Theorem via the Alon–Tarsi Theorem
inferredcites →https://doi.org/10.1016/j.disc.2011.05.038openalex-snapshot
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
inferredcites →https://doi.org/10.1016/j.disc.2014.01.024openalex-snapshot
Brooks’ theorem on powers of graphs
inferredcites →https://doi.org/10.1016/j.disc.2014.02.002openalex-snapshot
Strong edge-coloring of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2014.05.008openalex-snapshot
A note on list-coloring powers of graphs
inferredcites →https://doi.org/10.1016/j.disc.2014.06.004openalex-snapshot
On strong list edge coloring of subcubic graphs
inferredcites →https://doi.org/10.1016/j.disc.2015.11.012openalex-snapshot
Coloring the square of graphs whose maximum average degree is less than 4
inferredcites →https://doi.org/10.1016/j.disc.2016.11.022openalex-snapshot
An introduction to the discharging method via graph coloring
inferredcites →https://doi.org/10.1016/j.disc.2018.10.019openalex-snapshot
Strong edge-coloring for planar graphs with large girth
inferredcites →https://doi.org/10.1016/j.disc.2022.113288openalex-snapshot
Improved square coloring of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2024.114292openalex-snapshot
2-Distance (Δ + 1)-coloring of sparse graphs using the potential method
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.005openalex-snapshot
Coloring squares of planar graphs with girth six
inferredcites →https://doi.org/10.1016/j.ejc.2013.02.007openalex-snapshot
Acyclic edge-coloring using entropy compression
inferredcites →https://doi.org/10.1016/j.ejc.2014.03.006openalex-snapshot
List coloring the square of sparse graphs with large degree
inferredcites →https://doi.org/10.1016/j.ejc.2015.07.002openalex-snapshot
Strong chromatic index of subcubic planar multigraphs
inferredcites →https://doi.org/10.1016/j.ejc.2017.06.001openalex-snapshot
Strong edge-colorings of sparse graphs with large maximum degree
inferredcites →https://doi.org/10.1016/j.endm.2007.07.079openalex-snapshot
List Colouring Squares of Planar Graphs
inferredcites →https://doi.org/10.1016/j.endm.2015.06.038openalex-snapshot
A Stronger Bound for the Strong Chromatic Index
inferredcites →https://doi.org/10.1016/j.endm.2015.06.104openalex-snapshot
Strong edge coloring sparse graphs
inferredcites →https://doi.org/10.1016/j.endm.2017.07.025openalex-snapshot
Distance colouring without one cycle length
inferredcites →https://doi.org/10.1016/j.jctb.2004.12.005openalex-snapshot
A bound on the chromatic number of the square of a planar graph
inferredcites →https://doi.org/10.1016/j.jctb.2010.12.005openalex-snapshot
Fractional total colourings of graphs of high girth
inferredcites →https://doi.org/10.1016/j.jctb.2017.08.010openalex-snapshot
The square of a planar cubic graph is 7-colorable
inferredcites →https://doi.org/10.1016/j.jctb.2018.05.007openalex-snapshot
Chromatic numbers of exact distance graphs
inferredcites →https://doi.org/10.1016/j.jctb.2018.06.005openalex-snapshot
Planar graphs of girth at least five are square (Δ + 2)-choosable
inferredcites →https://doi.org/10.1016/j.jctb.2018.06.007openalex-snapshot
The list chromatic number of graphs with small clique number
inferredcites →https://doi.org/10.1016/j.jctb.2022.01.009openalex-snapshot
Colouring graphs with sparse neighbourhoods: Bounds and applications
inferredcites →https://doi.org/10.1016/j.tcs.2013.08.019openalex-snapshot
Total coloring of planar graphs with 7-cycles containing at most two chords
inferredcites →https://doi.org/10.1016/j.tcs.2013.12.006openalex-snapshot
Total coloring of planar graphs with maximum degree 8
inferredcites →https://doi.org/10.1016/j.tcs.2014.01.022openalex-snapshot
Total colorings of planar graphs with sparse triangles
inferredcites →https://doi.org/10.1016/s0012-365x(00)00371-xopenalex-snapshot
Choosability conjectures and multicircuits
inferredcites →https://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferredcites →https://doi.org/10.1017/s0963548300001899openalex-snapshot
An Improvement of Hind's Upper Bound on the Total Chromatic Number
inferredcites →https://doi.org/10.1017/s0963548301004898openalex-snapshot
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
inferredcites →https://doi.org/10.1017/s0963548301004965openalex-snapshot
The Chromatic Number of Graph Powers
inferredcites →https://doi.org/10.1017/s0963548397003210openalex-snapshot
List Total Colourings of Graphs
inferredcites →https://doi.org/10.1093/comjnl/bxr037openalex-snapshot
The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography
inferredcites →https://doi.org/10.1109/swct.1964.27openalex-snapshot
Topological constraints on interconnection-limited logic
inferredcites →https://doi.org/10.1112/jlms/s2-3.3.405openalex-snapshot
On Total Chromatic Number of a Graph
inferredcites →https://doi.org/10.1134/s1990478911040089openalex-snapshot
2-Distance 4-coloring of planar subcubic graphs
inferredcites →https://doi.org/10.1137/0405048openalex-snapshot
Labelling Graphs with a Condition at Distance 2
inferredcites →https://doi.org/10.1137/050634049openalex-snapshot
List-Coloring Squares of Sparse Subcubic Graphs
inferredcites →https://doi.org/10.1137/070688389openalex-snapshot
Total-Coloring of Plane Graphs with Maximum Degree Nine
inferredcites →https://doi.org/10.1137/090763998openalex-snapshot
Griggs and Yeh's Conjecture and $L(p,1)$-labelings
inferredcites →https://doi.org/10.1137/090779097openalex-snapshot
The Last Fraction of a Fractional Conjecture
inferredcites →https://doi.org/10.1137/10080453xopenalex-snapshot
Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
inferredcites →https://doi.org/10.1137/17m1157313openalex-snapshot
2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
inferredcites →https://doi.org/10.1137/21m1437354openalex-snapshot
Maximizing Line Subgraphs of Diameter at Most t
inferredcites →https://doi.org/10.1137/s0895480100367950openalex-snapshot
Coloring Powers of Planar Graphs
inferredcites →https://doi.org/10.1137/s0895480101390448openalex-snapshot
Labeling Planar Graphs with Conditions on Girth and Distance Two
inferredcites →https://doi.org/10.1137/s0895480101399449openalex-snapshot
A Theorem about the Channel Assignment Problem
inferredcites →https://doi.org/10.1137/s0895480103424079openalex-snapshot
Coloring Powers of Chordal Graphs
inferredcites →https://doi.org/10.1137/s0895480193245339openalex-snapshot
The $L(2,1)$-Labeling Problem on Graphs
inferredcites →https://doi.org/10.1147/rd.45.0497openalex-snapshot
On Moore Graphs with Diameters 2 and 3
inferredcites →https://doi.org/10.1515/crll.1989.394.180openalex-snapshot
On the total coloring of planar graphs.
inferredcites →https://doi.org/10.17877/de290r-16496openalex-snapshot
Graphs with given diameter and a coloring problem
inferredcites →https://doi.org/10.18154/rwth-2017-08007openalex-snapshot
On graph sparsity and structure : colourings and graph decompositions
inferredcites →https://doi.org/10.19086/aic.2022.7openalex-snapshot
An improved procedure for colouring graphs of bounded local density
inferredcites →https://doi.org/10.37236/285openalex-snapshot
Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
inferredcites →https://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferredcites →https://doi.org/10.37236/4343openalex-snapshot
Bipartite Graphs whose Squares are not Chromatic-Choosable
inferredcites →https://doi.org/10.37236/7016openalex-snapshot
Strong Chromatic Index of Graphs With Maximum Degree Four
inferredcites →https://doi.org/10.4171/8ecm/11openalex-snapshot
Graph and hypergraph colouring via nibble methods: A survey
inferredcites →https://doi.org/10.46298/dmtcs.349openalex-snapshot
On the maximum average degree and the incidence chromatic number of a graph
inferredcites →https://doi.org/10.46298/dmtcs.7563openalex-snapshot
2-distance 4-coloring of planar subcubic graphs with girth at least 21
inferredcites →https://doi.org/10.48550/arxiv.1303.5156openalex-snapshot
Choosability of the square of a planar graph with maximum degree four
inferredcites →https://doi.org/10.48550/arxiv.1402.5677openalex-snapshot
List strong edge coloring of some classes of graphs
inferredcites →https://doi.org/10.48550/arxiv.1502.03132openalex-snapshot
Coloring the square of a sparse graph $G$ with almost $Δ(G)$ colors
inferredcites →https://doi.org/10.48550/arxiv.1604.06504openalex-snapshot
The chromatic number of the square of subcubic planar graphs
inferredcites →https://doi.org/10.48550/arxiv.2003.14361openalex-snapshot
Graph structure via local occupancy
inferredcites →https://doi.org/10.48550/arxiv.2010.13443openalex-snapshot
Moore graph with parameters (3250,57,0,1) does not exist
inferredcites →https://doi.org/10.48550/arxiv.2210.09577openalex-snapshot
Existence of a Moore graph of degree 57 is still open
inferredcites →https://doi.org/10.48550/arxiv.2211.00622openalex-snapshot
The List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs
inferredcites →https://doi.org/10.7151/dmgt.1583openalex-snapshot
List coloring of complete multipartite graphs
inferredcites →https://doi.org/10.7151/dmgt.1592openalex-snapshot
2-distance 4-colorability of planar subcubic graphs with girth at least 22
inferredcites →https://doi.org/10.7151/dmgt.1708openalex-snapshot
Precise upper bound for the strong edge chromatic number of sparse planar graphs
inferredcites →https://doi.org/10.7151/dmgt.1763openalex-snapshot
Strong chromatic index of planar graphs with large girth
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23125openalex-snapshot
Cliques in squares of graphs with maximum average degree less than 4
inferred← citeshttps://doi.org/10.1002/jgt.23201openalex-snapshot
Tight Upper Bound on the Clique Size in the Square of 2‐Degenerate Graphs
inferred← citeshttps://doi.org/10.1002/jgt.70014openalex-snapshot
χ‐Binding Functions for Squares of Convex Bipartite Graphs and Partite Testability for Bipartite Squares
inferred← citeshttps://doi.org/10.1007/s00373-026-03032-wopenalex-snapshot
The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable
inferred← citeshttps://doi.org/10.1007/s10255-025-0055-0openalex-snapshot
On 2-distance (Δ + 4)-coloring of Planar Graphs with girth Five
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.001openalex-snapshot
Square coloring of planar graphs with maximum degree at most five
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113963openalex-snapshot
The square of every subcubic planar graph of girth at least 6 is 7-choosable
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114225openalex-snapshot
Improved 2-distance coloring of planar graphs with maximum degree 5
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114377openalex-snapshot
Subchromatic numbers of powers of graphs with excluded minors
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114379openalex-snapshot
On 2-distance 16-coloring of planar graphs with maximum degree at most five
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.103960openalex-snapshot
Bounding clique size in squares of planar graphs
inferred← citeshttps://doi.org/10.17485/ijst/v16isp3.icrtam135openalex-snapshot
List Coloring Problem: A Heuristic Approach
inferred← citeshttps://doi.org/10.3390/axioms12060556openalex-snapshot
Strong Edge Coloring of K4(t)-Minor Free 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.