On the public citation graph
Acyclic colorings of planar graphs
0 signed · 394 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.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/bf01444968openalex-snapshot
�ber den kartographischen Vierfarbensatz
inferredcites →https://doi.org/10.1007/bfb0059436openalex-snapshot
A class of point partition numbers
inferredcites →https://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferredcites →https://doi.org/10.1016/0097-3165(73)90012-5openalex-snapshot
Shortness exponents of families of graphs
inferredcites →https://doi.org/10.1080/00029890.1967.11999994openalex-snapshot
Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)
inferredcites →https://doi.org/10.1080/00029890.1970.11992672openalex-snapshot
A Problem in Graph Coloring
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12559-9openalex-snapshot
$B$-sets and coloring problems
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0291019-5openalex-snapshot
A $4$-color theorem for toroidal graphs
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.612openalex-snapshot
The Point-Arboricity of Planar Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-1.1.750openalex-snapshot
An Analogue to the Heawood Map-Colouring Problem
inferredcites →https://doi.org/10.1112/jlms/s2-4.4.577openalex-snapshot
The Point Partition Numbers of Closed 2-Manifolds
inferredcites →https://doi.org/10.1307/mmj/1028998916openalex-snapshot
Grötzsch's theorem on $3$-colorings.
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(199909)32:1<97::aid-jgt9>3.0.co;2-oopenalex-snapshot
Acrylic improper colorings of graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.10035openalex-snapshot
Acyclic list 7‐coloring of planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.20064openalex-snapshot
The acyclic edge chromatic number of a random d‐regular graph is d + 1
inferred← citeshttps://doi.org/10.1002/jgt.20134openalex-snapshot
On the acyclic choosability of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20167openalex-snapshot
The generalized acyclic edge chromatic number of random regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.20206openalex-snapshot
Acyclic 5‐choosability of planar graphs without small cycles
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.20338openalex-snapshot
Game coloring the Cartesian product of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20342openalex-snapshot
Star coloring bipartite planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.20376openalex-snapshot
Acyclic edge coloring of graphs with maximum degree 4
inferred← citeshttps://doi.org/10.1002/jgt.20381openalex-snapshot
Planar graphs without 4‐cycles are acyclically 6‐choosable
inferred← citeshttps://doi.org/10.1002/jgt.20422openalex-snapshot
d ‐Regular graphs of acyclic chromatic index at least d +2
inferred← citeshttps://doi.org/10.1002/jgt.20431openalex-snapshot
Star coloring planar graphs from small lists
inferred← citeshttps://doi.org/10.1002/jgt.20436openalex-snapshot
Acyclic edge chromatic number of outerplanar graphs
inferred← citeshttps://doi.org/10.1002/jgt.20501openalex-snapshot
Bounds on vertex colorings with restrictions on the union of color classes
inferred← citeshttps://doi.org/10.1002/jgt.20549openalex-snapshot
Acyclic 5-choosability of planar graphs without adjacent short cycles
inferred← citeshttps://doi.org/10.1002/jgt.20559openalex-snapshot
Acyclic edge coloring of 2‐degenerate graphs
inferred← citeshttps://doi.org/10.1002/jgt.20604openalex-snapshot
A sufficient condition for planar graphs to be acyclically 5‐choosable
inferred← citeshttps://doi.org/10.1002/jgt.20650openalex-snapshot
Optimal acyclic edge‐coloring of cubic graphs
inferred← citeshttps://doi.org/10.1002/jgt.20651openalex-snapshot
Acyclic Edge Coloring of Triangle‐Free Planar Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21647openalex-snapshot
Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
inferred← citeshttps://doi.org/10.1002/jgt.21862openalex-snapshot
Star Edge Coloring of Some Classes of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22402openalex-snapshot
Note on list star edge‐coloring of subcubic graphs
inferred← citeshttps://doi.org/10.1002/jgt.22827openalex-snapshot
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
inferred← citeshttps://doi.org/10.1002/jgt.23062openalex-snapshot
Partitioning kite‐free planar graphs into two forests
inferred← citeshttps://doi.org/10.1002/jgt.23154openalex-snapshot
Defective acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1002/mana.19921580108openalex-snapshot
Structural Properties of Planar Maps with the Minimal Degree 5
inferred← citeshttps://doi.org/10.1002/mana.19941700103openalex-snapshot
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
inferred← citeshttps://doi.org/10.1002/rsa.20695openalex-snapshot
Acyclic edge colourings of graphs with large girth
inferred← citeshttps://doi.org/10.1007/11604686_21openalex-snapshot
Acyclic Choosability of Graphs with Small Maximum Degree
inferred← citeshttps://doi.org/10.1007/11809678_38openalex-snapshot
Optimal Acyclic Edge Colouring of Grid Like Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_23openalex-snapshot
Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths
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-95018-7_7openalex-snapshot
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_12openalex-snapshot
On Structural Parameterizations of Star Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_1openalex-snapshot
Probabilistic Arguments in Graph Coloring (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_14openalex-snapshot
Acyclic Edge Colouring of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_13openalex-snapshot
Structural Properties of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_25openalex-snapshot
On Counting Generalized Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_9openalex-snapshot
Forbidden Subgraph Colorings and the Oriented Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_11openalex-snapshot
Acyclically 3-Colorable Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_18openalex-snapshot
Strong Orientations of Planar Graphs with Bounded Stretch Factor
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_17openalex-snapshot
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_20openalex-snapshot
Acyclic Colorings of Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_51openalex-snapshot
A Sharper Local Lemma with Improved Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_11openalex-snapshot
Acyclic Coloring with Few Division Vertices
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_16openalex-snapshot
Computing Light Edges in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_23openalex-snapshot
Acyclic 4-choosability of Planar Graphs with Girth at Least 5
inferred← citeshttps://doi.org/10.1007/978-981-96-4745-3_2openalex-snapshot
Discharging and Structure of Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/bf00183214openalex-snapshot
Strengthening of a theorem about 3-polytopes
inferred← citeshttps://doi.org/10.1007/bf02675788openalex-snapshot
Acyclick-strong coloring of maps on surfaces
inferred← citeshttps://doi.org/10.1007/bf02759792openalex-snapshot
Every planar graph has an acyclic 7-coloring
inferred← citeshttps://doi.org/10.1007/bf02762708openalex-snapshot
On acyclic colorings of graphs on surfaces
inferred← citeshttps://doi.org/10.1007/bf02764717openalex-snapshot
Note on a paper of B. Grünbaum on acyclic colorings
inferred← citeshttps://doi.org/10.1007/s00373-005-0635-yopenalex-snapshot
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-1009-7openalex-snapshot
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree
inferred← citeshttps://doi.org/10.1007/s00373-011-1043-0openalex-snapshot
Acyclic Edge Coloring of Planar Graphs Without Small Cycles
inferred← citeshttps://doi.org/10.1007/s00373-013-1289-9openalex-snapshot
The Linear t-Colorings of Sierpiński-Like 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.1007/s00373-020-02254-wopenalex-snapshot
Acyclic Coloring of Graphs with Maximum Degree 7
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/s00453-015-0050-6openalex-snapshot
Separation Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
inferred← citeshttps://doi.org/10.1007/s004930100001openalex-snapshot
On a Max-min Problem Concerning Weights of Edges
inferred← citeshttps://doi.org/10.1007/s10114-011-0317-zopenalex-snapshot
New upper bounds on linear coloring of planar graphs
inferred← citeshttps://doi.org/10.1007/s10114-011-8640-yopenalex-snapshot
Acyclic total colorings of planar graphs without l cycles
inferred← citeshttps://doi.org/10.1007/s10114-013-1497-5openalex-snapshot
Every toroidal graph is acyclically 8-choosable
inferred← citeshttps://doi.org/10.1007/s10114-019-8546-7openalex-snapshot
Upper Bounds on List Star Chromatic Index of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s10114-021-9335-7openalex-snapshot
Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles
inferred← citeshttps://doi.org/10.1007/s10114-022-0097-7openalex-snapshot
Acyclic Choosability of Graphs with Bounded Degree
inferred← citeshttps://doi.org/10.1007/s10114-023-1518-yopenalex-snapshot
Every Graph Embedded on the Surface with Euler Characteristic Number ε = −1 is Acyclically 11-choosable
inferred← citeshttps://doi.org/10.1007/s10255-014-0293-zopenalex-snapshot
Improved upper bounds on acyclic edge colorings
inferred← citeshttps://doi.org/10.1007/s10255-016-0541-5openalex-snapshot
Improved bounds on the generalized acyclic chromatic number
inferred← citeshttps://doi.org/10.1007/s10255-020-0936-1openalex-snapshot
List Vertex-arboricity of Planar Graphs without Intersecting 5-cycles
inferred← citeshttps://doi.org/10.1007/s10288-011-0157-9openalex-snapshot
Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics
inferred← citeshttps://doi.org/10.1007/s10878-011-9385-3openalex-snapshot
Acyclically 3-colorable planar graphs
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-013-9619-7openalex-snapshot
The $$r$$ r -acyclic chromatic number of planar graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9799-9openalex-snapshot
Acyclic 3-coloring of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9829-2openalex-snapshot
Acyclic coloring of graphs with some girth restriction
inferred← citeshttps://doi.org/10.1007/s10878-019-00461-7openalex-snapshot
Tree-coloring problems of bounded treewidth graphs
inferred← citeshttps://doi.org/10.1007/s11424-010-0211-2openalex-snapshot
The method of coloring in graphs and its application
inferred← citeshttps://doi.org/10.1007/s11425-008-0124-xopenalex-snapshot
Acyclic edge colorings of planar graphs and seriesparallel graphs
inferred← citeshttps://doi.org/10.1007/s11425-008-0143-7openalex-snapshot
Linear coloring of graphs embeddable in a surface of nonnegative characteristic
inferred← citeshttps://doi.org/10.1007/s11425-010-0073-zopenalex-snapshot
Improved bounds on linear coloring of plane graphs
inferred← citeshttps://doi.org/10.1007/s11425-010-3073-0openalex-snapshot
Improved bounds on linear coloring of plane graphs
inferred← citeshttps://doi.org/10.1007/s11425-013-4572-6openalex-snapshot
Acyclic 6-choosability of planar graphs without adjacent short cycles
inferred← citeshttps://doi.org/10.1007/s11425-014-4828-9openalex-snapshot
Acyclic improper colouring of graphs with maximum degree 4
inferred← citeshttps://doi.org/10.1007/s11425-016-5126-5openalex-snapshot
Acyclic colorings of graphs with bounded degree
inferred← citeshttps://doi.org/10.1007/s11464-015-0497-4openalex-snapshot
Acyclic coloring of graphs without bichromatic long path
inferred← citeshttps://doi.org/10.1007/s12046-023-02164-6openalex-snapshot
Application of acyclic coloring in wavelength assignment problem for butterfly and Beneš network
inferred← citeshttps://doi.org/10.1007/s12190-010-0448-xopenalex-snapshot
Acyclic edge coloring of planar graphs without cycles of specific lengths
inferred← citeshttps://doi.org/10.1007/s40009-025-01801-4openalex-snapshot
Acyclic Graph Coloring Analysis in the Corona Product 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.1007/s40314-022-02156-yopenalex-snapshot
On b-acyclic chromatic number of a graph
inferred← citeshttps://doi.org/10.1007/s40840-020-01040-4openalex-snapshot
Coloring Graphs Without Bichromatic Cycles or Paths
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90075-3openalex-snapshot
Note to the paper of Grünbaum on acyclic colorings
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00984-5openalex-snapshot
A new proof of Grünbaum's 3 color theorem
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00088-3openalex-snapshot
Good and semi-strong colorings of oriented planar graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.005openalex-snapshot
On the complexity of generalized chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.amc.2015.09.084openalex-snapshot
Acyclic and star coloring of P 4 -reducible and P 4 -sparse 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.2019.03.027openalex-snapshot
Acyclic improper choosability of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125353openalex-snapshot
A note on a conjecture of star chromatic index for outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125741openalex-snapshot
Star edge-coloring of square grids
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129614openalex-snapshot
An identifying operation on a 1-planar graph with an application to acyclic coloring
inferred← citeshttps://doi.org/10.1016/j.aml.2012.04.011openalex-snapshot
List total arboricity of 2-degenerate graphs
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.05.008openalex-snapshot
Frugal, acyclic and star colourings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.017openalex-snapshot
Acyclic chromatic indices of planar graphs with large girth
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.01.017openalex-snapshot
Acyclic edge coloring of planar graphs with Δ colors
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.11.006openalex-snapshot
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
inferred← citeshttps://doi.org/10.1016/j.dam.2014.03.019openalex-snapshot
On linear coloring of planar graphs with small girth
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.2017.12.010openalex-snapshot
List star edge coloring of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.030openalex-snapshot
List star edge-coloring of k -degenerate graphs and K4 -minor free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.010openalex-snapshot
An improved upper bound for the acyclic chromatic number of 1-planar graphs
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.2022.01.019openalex-snapshot
A new approach on locally checkable problems
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.001openalex-snapshot
Acyclic coloring of claw-free graphs with small degree
inferred← citeshttps://doi.org/10.1016/j.dam.2023.11.030openalex-snapshot
Hardness transitions and uniqueness of acyclic colouring
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.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.03.006openalex-snapshot
Improved bounds on acyclic edge colouring
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.112openalex-snapshot
Linear choosability of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.076openalex-snapshot
Acyclic 5-choosability of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.036openalex-snapshot
Acyclic edge coloring of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.032openalex-snapshot
Linear coloring of planar graphs with large girth
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.009openalex-snapshot
Acyclic improper colourings of graphs with bounded maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.014openalex-snapshot
A note on acyclic edge coloring of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.04.032openalex-snapshot
Homomorphisms of triangle-free graphs without a K5 -minor
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.018openalex-snapshot
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.036openalex-snapshot
On acyclic 4-choosability of planar graphs without short cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.032openalex-snapshot
Acyclic 3-choosability of sparse graphs with girth at least 7
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.033openalex-snapshot
Optimal acyclic edge colouring of grid like graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.001openalex-snapshot
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.10.003openalex-snapshot
Acyclic 4-choosability of planar graphs
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.2011.01.023openalex-snapshot
The complexity of some acyclic improper colourings
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.017openalex-snapshot
Linear choosability of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.08.030openalex-snapshot
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.031openalex-snapshot
k -forested choosability of planar graphs and sparse graphs
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.04.025openalex-snapshot
Weights of induced subgraphs in K1,r -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.038openalex-snapshot
Acyclic 4-choosability of planar graphs without adjacent short cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.007openalex-snapshot
Light subgraphs of graphs embedded in the plane—A survey
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.2014.01.022openalex-snapshot
Acyclic vertex coloring of graphs of maximum degree six
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.07.010openalex-snapshot
On acyclic edge-coloring of the complete bipartite graphs K2p−1,2p−1 for odd prime p
inferred← citeshttps://doi.org/10.1016/j.disc.2016.02.003openalex-snapshot
Equitable vertex arboricity of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.010openalex-snapshot
List vertex-arboricity of toroidal graphs without 4 -cycles adjacent to 3 -cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.002openalex-snapshot
New bounds for the acyclic chromatic index
inferred← citeshttps://doi.org/10.1016/j.disc.2016.08.026openalex-snapshot
On acyclic edge-coloring of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.10.023openalex-snapshot
On homomorphisms of oriented graphs with respect to the push operation
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.2018.03.012openalex-snapshot
List star chromatic index of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.008openalex-snapshot
Oriented colourings of graphs with maximum degree three and four
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.012openalex-snapshot
Characterization of forbidden subgraphs for bounded star chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.015openalex-snapshot
Maximizing and minimizing the number of generalized colorings of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2019.02.018openalex-snapshot
List star edge coloring of k -degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.012openalex-snapshot
Acyclic coloring of graphs with maximum degree at most six
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.2019.111623openalex-snapshot
Acyclic coloring of IC-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111772openalex-snapshot
Acyclic coloring of graphs and entropy compression method
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112351openalex-snapshot
Equitable partition of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112476openalex-snapshot
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
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.disc.2023.113434openalex-snapshot
Acyclic chromatic index of chordless graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113898openalex-snapshot
Upper bounds on the acyclic chromatic index of degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115135openalex-snapshot
Acyclic edge coloring of 3-sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115346openalex-snapshot
On acyclic 4-choosability of planar graphs without cycles of length 4, 8 and 9
showing the first 200 of 376 · page through all 376
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.