On the public citation graph

Star Coloring High Girth Planar Graphs

https://doi.org/10.37236/848
0 signed · 33 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.1002/jgt.20431openalex-snapshot
Star coloring planar graphs from small lists
inferredcites →https://doi.org/10.1002/jgt.v63:4openalex-snapshot
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_29openalex-snapshot
Colorings and Homomorphisms of Minor Closed Classes
inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1112/s0024610799007942openalex-snapshot
Acyclic Colourings of Planar Graphs with Large Girth
inferredcites →https://doi.org/10.37236/1779openalex-snapshot
Coloring with no $2$-Colored $P_4$'s

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.20392openalex-snapshot
Star coloring of sparse graphs
inferred← citeshttps://doi.org/10.1002/jgt.20431openalex-snapshot
Star coloring planar graphs from small lists
inferred← citeshttps://doi.org/10.1002/jgt.v63:4openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_59openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_59-1openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07890-8_3openalex-snapshot
Happy Edges: Threshold-Coloring of Regular Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_12openalex-snapshot
On the Small Cycle Transversal of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_17openalex-snapshot
Weak Unit Disk and Interval Representation of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1702-2openalex-snapshot
Star Coloring of Graphs with Girth at Least Five
inferred← citeshttps://doi.org/10.1007/s00373-017-1864-6openalex-snapshot
Star Coloring of Certain Graph Classes
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.009openalex-snapshot
On star 5-colorings of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.011openalex-snapshot
Colorings of plane graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.022openalex-snapshot
An introduction to the discharging method via graph coloring
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.03.003openalex-snapshot
I,F-partitions of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2016.05.035openalex-snapshot
Star chromatic bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.040openalex-snapshot
On the small cycle transversal of planar graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139087223.009openalex-snapshot
Colouring graphs on surfaces
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.004openalex-snapshot
Colouring graphs on surfaces
inferred← citeshttps://doi.org/10.37236/10738openalex-snapshot
Acyclic, Star, and Injective Colouring: Bounding the Diameter
inferred← citeshttps://doi.org/10.37236/9110openalex-snapshot
Representing Graphs as the Intersection of Cographs and Threshold Graphs
inferred← citeshttps://doi.org/10.3934/math.2022786openalex-snapshot
On star and acyclic coloring of generalized lexicographic product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2053openalex-snapshot
Happy Edges: Threshold-Coloring of Regular Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4434openalex-snapshot
An Introduction to the Discharging Method via Graph Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1408.6928openalex-snapshot
Weak Unit Disk and Interval Representation of Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.03910openalex-snapshot
Star coloring splitting graphs 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.