On the public citation graph
The point-arboricity of a graph
0 signed · 116 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/bf01895727openalex-snapshot
On the maximal number of independent circuits in a graph
inferredcites →https://doi.org/10.1007/bf01901931openalex-snapshot
On the maximal number of independent circuits in a graph
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-snapshot
Decomposition of Finite Graphs Into Forests
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.10010openalex-snapshot
On the critical point‐arboricity graphs
inferred← citeshttps://doi.org/10.1002/jgt.22032openalex-snapshot
Planar Digraphs of Digirth Five Are 2‐Colorable
inferred← citeshttps://doi.org/10.1002/jgt.23062openalex-snapshot
Partitioning kite‐free planar graphs into two forests
inferred← citeshttps://doi.org/10.1002/jgt.3190070302openalex-snapshot
Maximum versus minimum invariants for graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190140108openalex-snapshot
On the linear vertex‐arboricity of a planar graph
inferred← citeshttps://doi.org/10.1002/jgt.3190140113openalex-snapshot
Bounds for the vertex linear arboricity
inferred← citeshttps://doi.org/10.1002/net.3230150108openalex-snapshot
A compilation of relations between graph invariants
inferred← citeshttps://doi.org/10.1006/jctb.2000.1962openalex-snapshot
Surfaces, Tree-Width, Clique-Minors, and Partitions
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_17openalex-snapshot
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_82openalex-snapshot
NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_45openalex-snapshot
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_20openalex-snapshot
Supereulerian Testing on Semi-Eulerian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70666-3_26openalex-snapshot
Fractional Vertex Arboricity of Graphs
inferred← citeshttps://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0015449openalex-snapshot
NC algorithms for partitioning sparse graphs into induced forests with an application
inferred← citeshttps://doi.org/10.1007/bfb0059436openalex-snapshot
A class of point partition numbers
inferred← citeshttps://doi.org/10.1007/s00010-023-01000-wopenalex-snapshot
Achromatic arboricity on complete graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1466-5openalex-snapshot
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02177-6openalex-snapshot
A Generalization of Some Results on List Coloring and DP-Coloring
inferred← citeshttps://doi.org/10.1007/s00373-024-02758-9openalex-snapshot
On Inducing Degenerate Sums Through 2-Labellings
inferred← citeshttps://doi.org/10.1007/s00373-024-02817-1openalex-snapshot
The Robust Chromatic Number of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-024-02820-6openalex-snapshot
The Vertex Arboricity of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-005-1176-8openalex-snapshot
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
inferred← citeshttps://doi.org/10.1007/s10013-020-00462-8openalex-snapshot
Acyclic Sum-List-Colouring of Cylinders
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/s10878-017-0168-3openalex-snapshot
Vertex arboricity of planar graphs without intersecting 5-cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90115-8openalex-snapshot
Induced forests in cubic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90196-9openalex-snapshot
The subchromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90211-2openalex-snapshot
Chromatic partitions of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90493-dopenalex-snapshot
Generalizations of independence and chromatic numbers of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0205-iopenalex-snapshot
Vertex arboricity and maximum degree
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00173-wopenalex-snapshot
On the minors of an incidence matrix and its Smith normal form
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00139-5openalex-snapshot
Conditional chromatic numbers with forbidden cycles
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90234-fopenalex-snapshot
On generalized perfect graphs: bounded degree and bounded edge perfection
inferred← citeshttps://doi.org/10.1016/0166-218x(96)00089-3openalex-snapshot
Parallel complexity of partitioning a planar graph into vertex-induced forests
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.005openalex-snapshot
A short proof of Brooks’ Theorem for vertex arboricity
inferred← citeshttps://doi.org/10.1016/j.aml.2006.01.017openalex-snapshot
Tree coloring of distance graphs with a real interval set
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.dam.2014.06.024openalex-snapshot
Randić index and coloring number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.020openalex-snapshot
Vertex-arboricity of toroidal graphs without K 5 − and 6-cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2023.11.001openalex-snapshot
Partitioning of a graph into induced subgraphs not containing prescribed cliques
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.024openalex-snapshot
Commutative rings with unit graphs of small vertex-arboricity
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.016openalex-snapshot
Partition the vertices of a graph into one independent set and one acyclic set
inferred← citeshttps://doi.org/10.1016/j.disc.2006.10.017openalex-snapshot
On the vertex arboricity of planar graphs of diameter two
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.035openalex-snapshot
On the vertex-arboricity of planar graphs without 7-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.017openalex-snapshot
On the vertex-arboricity of K 5 -minor-free graphs of diameter 2
inferred← citeshttps://doi.org/10.1016/j.disc.2014.06.011openalex-snapshot
Vertex arboricity of toroidal graphs with a forbidden cycle
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.2018.08.021openalex-snapshot
A note on the list vertex arboricity of toroidal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112765openalex-snapshot
Cover and variable degeneracy
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112865openalex-snapshot
Two sufficient conditions for a planar graph to be list vertex-2-arborable
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112911openalex-snapshot
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113998openalex-snapshot
A note on the list vertex-arboricity of IC-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.022openalex-snapshot
On the vertex-arboricity of planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.017openalex-snapshot
Vertex-arboricity of planar graphs without intersecting triangles
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.010openalex-snapshot
The k -strong induced arboricity of a graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.020openalex-snapshot
Induced-path partition on graphs with special blocks
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.009openalex-snapshot
A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.007openalex-snapshot
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)84217-3openalex-snapshot
The complexity of G-free colourability
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00340-9openalex-snapshot
A sequential coloring algorithm for finite sets
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00386-5openalex-snapshot
Computers and discovery in algebraic graph theory
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70296-6openalex-snapshot
The Subchromatic Number of a Graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70311-xopenalex-snapshot
Chromatic Partitions of a Graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00254-5openalex-snapshot
Efficient algorithms for acyclic colorings of graphs
inferred← citeshttps://doi.org/10.1023/b:joco.0000038912.82046.17openalex-snapshot
Vertex and Tree Arboricities of Graphs
inferred← citeshttps://doi.org/10.1080/00207160.2012.727989openalex-snapshot
Vertex arboricity of planar graphs without chordal 6-cycles
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12559-9openalex-snapshot
$B$-sets and coloring problems
inferred← citeshttps://doi.org/10.1109/access.2019.2924052openalex-snapshot
Social Structure Decomposition With Security Issue
inferred← citeshttps://doi.org/10.1109/focs.2015.84openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1112/jlms/s2-1.1.750openalex-snapshot
An Analogue to the Heawood Map-Colouring Problem
inferred← citeshttps://doi.org/10.1112/jlms/s2-12.1.97openalex-snapshot
Point Arboricity Critical Graphs Exist
inferred← citeshttps://doi.org/10.1137/110846828openalex-snapshot
Planar Graphs Have Exponentially Many 3-Arboricities
inferred← citeshttps://doi.org/10.1142/s1793830912500279openalex-snapshot
LIST POINT ARBORICITY OF GRAPHS
inferred← citeshttps://doi.org/10.1142/s1793830920500809openalex-snapshot
Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
inferred← citeshttps://doi.org/10.1145/3034786.3056115openalex-snapshot
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
inferred← citeshttps://doi.org/10.1145/3088513openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1155/2017/4259810openalex-snapshot
A Structural Property of Trees with an Application to Vertex‐Arboricity
inferred← citeshttps://doi.org/10.1155/s0161171204311403openalex-snapshot
Conditional resolvability in graphs: a survey
inferred← citeshttps://doi.org/10.11845/sxjz.2014056bopenalex-snapshot
A Note on Arboricity of 2-edge-connected Cubic Graphs
inferred← citeshttps://doi.org/10.12677/aam.2026.155244openalex-snapshot
Partitioning Planar Graphs with Girth at Least 6 into Restricted Forest
inferred← citeshttps://doi.org/10.12677/pm.2021.118176openalex-snapshot
Vertex Arboricity Problem of Planar Graphs without Adjacent Short Cycles
inferred← citeshttps://doi.org/10.12732/ijpam.v87i6.7openalex-snapshot
ON VERTEX DISJOINT CYCLES OF MIDDLE AND TOTAL GRAPH OF $K_n$ AND $K_{m,n}$
inferred← citeshttps://doi.org/10.1360/ssm-2025-0014openalex-snapshot
Graphs with low genus and girth at least 5 admit an (F2,F6) -partition
inferred← citeshttps://doi.org/10.1556/314.2022.00015openalex-snapshot
Bipartite Domination in Graphs
inferred← citeshttps://doi.org/10.15672/hujms.589753openalex-snapshot
Rings whose total graphs have small vertex-arboricity and arboricity
inferred← citeshttps://doi.org/10.17863/cam.16222openalex-snapshot
Problems of optimal choice on posets and generalizations of acyclic colourings
inferred← citeshttps://doi.org/10.2298/fil1401217zopenalex-snapshot
A conjecture on equitable vertex arboricity of graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-4openalex-snapshot
On the Complexity of Digraph Colourings and Vertex Arboricity
inferred← citeshttps://doi.org/10.26782/jmcms.2020.08.00011openalex-snapshot
RELATIONSHIP BETWEENCOLORING,EMBEDDINGAND DECYCLING NUMBER OF A GRAPH
inferred← citeshttps://doi.org/10.37236/9455openalex-snapshot
Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph
inferred← citeshttps://doi.org/10.3934/math.2021567openalex-snapshot
List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4900openalex-snapshot
Planar graphs have exponentially many 3-arboricities
inferred← citeshttps://doi.org/10.48550/arxiv.1606.06114openalex-snapshot
Planar digraphs of digirth four are 2-colourable
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07174openalex-snapshot
The $k$-strong induced arboricity of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1708.03077openalex-snapshot
A note on the vertex arboricity of signed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.00815openalex-snapshot
Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring
inferred← citeshttps://doi.org/10.5281/zenodo.9025openalex-snapshot
Tulgeity Of Line, Middle And Total Graph Of Wheel Graph Families
inferred← citeshttps://doi.org/10.7151/dmgt.1037openalex-snapshot
A survey of hereditary properties of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1819openalex-snapshot
Chromatic sums for colorings avoiding monochromatic subgraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1874openalex-snapshot
Hamiltonicity and generalised total colourings of planar 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.