On the public citation graph
Coloring with no $2$-Colored $P_4$'s
0 signed · 150 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.1006/aima.1997.1650openalex-snapshot
Morse Theory for Cell Complexes
inferredcites →https://doi.org/10.1007/bf02566245openalex-snapshot
Harmonische Funktionen und Randwertaufgaben in einem Komplex
inferredcites →https://doi.org/10.1007/bf02759792openalex-snapshot
Every planar graph has an acyclic 7-coloring
inferredcites →https://doi.org/10.1007/bf02762708openalex-snapshot
On acyclic colorings of graphs on surfaces
inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1007/pl00009218openalex-snapshot
Computing Betti Numbers via Combinatorial Laplacians
inferredcites →https://doi.org/10.1007/s00454-004-1103-9openalex-snapshot
Obstructions to Shiftedness
inferredcites →https://doi.org/10.1016/0012-365x(76)90075-3openalex-snapshot
Note to the paper of Grünbaum on acyclic colorings
inferredcites →https://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/0024-3795(94)90486-3openalex-snapshot
Laplacian matrices of graphs: a survey
inferredcites →https://doi.org/10.1016/j.disc.2004.07.042openalex-snapshot
Weak acyclic coloring and asymmetric coloring games
inferredcites →https://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/s0012-365x(99)00258-7openalex-snapshot
On discrete Morse functions and combinatorial decompositions
inferredcites →https://doi.org/10.1017/s001708950000358xopenalex-snapshot
An acyclic analogue to Heawood's theorem
inferredcites →https://doi.org/10.1090/s0002-9947-02-03082-9openalex-snapshot
Shifted simplicial complexes are Laplacian integral
inferredcites →https://doi.org/10.1090/s0894-0347-99-00316-1openalex-snapshot
Combinatorial Laplacians of matroid complexes
inferredcites →https://doi.org/10.1112/s0024610799007942openalex-snapshot
Acyclic Colourings of Planar Graphs with Large Girth
inferredcites →https://doi.org/10.1215/s0012-7094-74-04119-2openalex-snapshot
Every planar graph has an acyclic 8-coloring
inferredcites →https://doi.org/10.4171/dm/200openalex-snapshot
A common recursion for Laplacians of matroids and shifted simplicial complexes
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.20299openalex-snapshot
A conjecture of Borodin and a coloring of Grünbaum
inferred← citeshttps://doi.org/10.1002/jgt.20431openalex-snapshot
Star coloring planar graphs from small lists
inferred← citeshttps://doi.org/10.1002/jgt.21862openalex-snapshot
Star Edge Coloring of Some Classes of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22230openalex-snapshot
Star chromatic index of subcubic multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.22402openalex-snapshot
Note on list star edge‐coloring of subcubic graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_19openalex-snapshot
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_1openalex-snapshot
Complexity of Restricted Variant of Star Colouring
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_2openalex-snapshot
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_26openalex-snapshot
Acyclic, Star, and Injective Colouring: Bounding the Diameter
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_7openalex-snapshot
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs
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-662-53174-7_17openalex-snapshot
Weak Unit Disk and Interval Representation of Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-7801-0_7openalex-snapshot
A Polynomial Time Algorithm to Find Star Chromatic Index on Bounded Treewidth Graphs with Given Maximum Degree
inferred← citeshttps://doi.org/10.1007/s00373-012-1130-xopenalex-snapshot
Boxicity of Graphs on Surfaces
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.1007/s00373-023-02739-4openalex-snapshot
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
inferred← citeshttps://doi.org/10.1007/s00373-025-02934-5openalex-snapshot
Strong Arboricity of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-024-01289-2openalex-snapshot
Complexity Framework for Forbidden Subgraphs I: The Framework
inferred← citeshttps://doi.org/10.1007/s00493-009-2257-0openalex-snapshot
Colourings of the cartesian product of graphs and multiplicative Sidon sets
inferred← citeshttps://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
inferred← citeshttps://doi.org/10.1007/s10468-012-9402-yopenalex-snapshot
Effective Constructions in Plethysms and Weintraub’s Conjecture
inferred← citeshttps://doi.org/10.1007/s10479-014-1537-2openalex-snapshot
Restricted coloring problems on Graphs with few P 4’s
inferred← citeshttps://doi.org/10.1007/s10801-006-8346-xopenalex-snapshot
Pointed and multi-pointed partitions of type A and B
inferred← citeshttps://doi.org/10.1007/s10878-012-9522-7openalex-snapshot
Star list chromatic number of planar subcubic graphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00680-3openalex-snapshot
Smaller universal targets for homomorphisms of edge-colored graphs
inferred← citeshttps://doi.org/10.1007/s11083-006-9028-yopenalex-snapshot
Upward Three-Dimensional Grid Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/s40306-018-0252-5openalex-snapshot
On Chromatic Numbers of Two Extensions of Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2018.02.015openalex-snapshot
On acyclically 4-colorable maximal planar graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2018.12.016openalex-snapshot
An upper bound for the choice number of star edge coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.011openalex-snapshot
Acyclic and star colorings of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.005openalex-snapshot
A polyhedral study of the acyclic coloring problem
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.031openalex-snapshot
On the tree-depth of random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.003openalex-snapshot
A polyhedral investigation of star colorings
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.dam.2021.03.007openalex-snapshot
On star edge colorings of bipartite and subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.015openalex-snapshot
The complexity of restricted star colouring
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.014openalex-snapshot
List star edge-coloring of claw-free subcubic multigraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.014openalex-snapshot
χ -boundedness and related problems on graphs without long induced paths: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.056openalex-snapshot
Hardness transitions of star colouring and restricted star colouring
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.042openalex-snapshot
Weak acyclic coloring and asymmetric coloring games
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.043openalex-snapshot
Nonrepetitive colorings of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.028openalex-snapshot
Generalization of transitive fraternal augmentations for directed graphs and its applications
inferred← citeshttps://doi.org/10.1016/j.disc.2010.10.024openalex-snapshot
Acyclic vertex coloring of graphs of maximum degree 5
inferred← citeshttps://doi.org/10.1016/j.disc.2012.02.005openalex-snapshot
On the number of 2-packings in a connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2012.02.007openalex-snapshot
Q -Ramsey classes of 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.2015.03.008openalex-snapshot
On vertex rankings of graphs and its relatives
inferred← citeshttps://doi.org/10.1016/j.disc.2015.03.019openalex-snapshot
Equitable partition of graphs into induced forests
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.disc.2017.12.008openalex-snapshot
Star 5-edge-colorings of subcubic multigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.07.001openalex-snapshot
Acyclic L -coloring of graphs with maximum degrees 5 and 6
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112620openalex-snapshot
Hat chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112631openalex-snapshot
On the weak 2-coloring number of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112850openalex-snapshot
Star colouring of bounded degree graphs and regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.07.013openalex-snapshot
Grad and classes with bounded expansion I. Decompositions
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.05.008openalex-snapshot
On forbidden subdivision characterizations of graph classes
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.007openalex-snapshot
Degenerate and star colorings of graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.09.002openalex-snapshot
Distance-two coloring of sparse graphs
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.2005.06.077openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.039openalex-snapshot
A Conjecture of Borodin and a Coloring of Grünbaum
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.006openalex-snapshot
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.063openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.057openalex-snapshot
Coloring parameters for graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.007openalex-snapshot
A polyhedral study of the acyclic coloring problem
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.030openalex-snapshot
Acyclic Vertex Coloring of Graphs of Maximum Degree Six
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.058openalex-snapshot
Intersection Dimension and Maximum Degree
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.011openalex-snapshot
Restricted coloring problems on graphs with few
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.05.013openalex-snapshot
Star coloring of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.02.009openalex-snapshot
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103662openalex-snapshot
Acyclic, star and injective colouring: A complexity picture for H-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.03.001openalex-snapshot
From the plane to higher surfaces
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.009openalex-snapshot
Universal targets for homomorphisms of edge-colored graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.05.007openalex-snapshot
Chromatic numbers of exact distance graphs
inferred← citeshttps://doi.org/10.1016/j.spl.2021.109044openalex-snapshot
Moments of characteristic polynomials in certain random neural networks
inferred← citeshttps://doi.org/10.1017/cbo9781139087223.009openalex-snapshot
Colouring graphs on surfaces
inferred← citeshttps://doi.org/10.1038/s41598-025-96645-9openalex-snapshot
Acyclic and star coloring parameters of fractal cubic networks
inferred← citeshttps://doi.org/10.1109/bdacs53596.2021.00038openalex-snapshot
Star coloring for a special class of graphs G1,d
inferred← citeshttps://doi.org/10.1112/plms.12210openalex-snapshot
Generalized Foulkes modules and maximal and minimal constituents of plethysms of Schur functions
inferred← citeshttps://doi.org/10.1137/050639879openalex-snapshot
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
inferred← citeshttps://doi.org/10.1137/060674211openalex-snapshot
Star Coloring and Acyclic Coloring of Locally Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1142/s1793830921500890openalex-snapshot
Star chromatic number of some graphs
inferred← citeshttps://doi.org/10.1142/s1793830922500409openalex-snapshot
Injective edge-coloring of subcubic graphs
inferred← citeshttps://doi.org/10.1142/s1793830922501786openalex-snapshot
Star chromatic number of some graph products
inferred← citeshttps://doi.org/10.1145/1322436.1322439openalex-snapshot
Computing sparse Hessians with automatic differentiation
inferred← citeshttps://doi.org/10.21953/lse.yczhu2j6vv7nopenalex-snapshot
Chromatic and structural properties of sparse graph classes
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-2019-05-0069openalex-snapshot
On star coloring of degree splitting of join graphs
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-3269openalex-snapshot
Star edge coloring of corona product of path and wheel graph families
inferred← citeshttps://doi.org/10.2478/v10209-011-0012-yopenalex-snapshot
A survey of graph coloring - its types, methods and applications
inferred← citeshttps://doi.org/10.26493/1855-3974.198.541openalex-snapshot
Graphs with maximum degree 5 are acyclically 7-colorable
inferred← citeshttps://doi.org/10.26637/mjm0804/0115openalex-snapshot
On star coloring of tensor product of graphs
inferred← citeshttps://doi.org/10.2989/16073606.2013.779976openalex-snapshot
Graph colourings with forbiddenk-coloured subgraphs
inferred← citeshttps://doi.org/10.31801/cfsuasmas.768497openalex-snapshot
On star coloring of modular product of graphs
inferred← citeshttps://doi.org/10.3233/jifs-241585openalex-snapshot
The star-chromatic number of snarks and its variants
inferred← citeshttps://doi.org/10.3390/a17090377openalex-snapshot
Star Bicolouring of Bipartite Graphs
inferred← citeshttps://doi.org/10.37236/10738openalex-snapshot
Acyclic, Star, and Injective Colouring: Bounding the Diameter
inferred← citeshttps://doi.org/10.37236/3153openalex-snapshot
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
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.4230/drops.memics.2009.2350openalex-snapshot
The Parameterized Complexity of Oriented Colouring
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2021.21openalex-snapshot
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferred← citeshttps://doi.org/10.46298/dmtcs.561openalex-snapshot
8-star-choosability of a graph with maximum average degree less than 3
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3401openalex-snapshot
Parameters Tied to Treewidth
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.1609.06111openalex-snapshot
On Vertex Rankings of Graphs and its Relatives
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06561openalex-snapshot
Star Coloring of the Cartesian Product of Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1907.09838openalex-snapshot
Injective edge-coloring of sparse graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.08017openalex-snapshot
A survey on star edge-coloring of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.01521openalex-snapshot
Avoiding large squares in trees and planar graphs
inferred← citeshttps://doi.org/10.61186/ijmsi.19.1.149openalex-snapshot
A Note on Acyclic Coloring of Strong Product of 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.