On the public citation graph
On decomposition of graphs
0 signed · 160 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/zamm.19600400516openalex-snapshot
C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/bf01886396openalex-snapshot
Partition relations for cardinal numbers
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bf02564361openalex-snapshot
Teilmengen von Mengen mit Relationen
inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot
On chromatic number of graphs and set systems
inferredcites →https://doi.org/10.1090/s0002-9904-1956-10036-0openalex-snapshot
A partition calculus in set theory
inferredcites →https://doi.org/10.1112/jlms/s1-35.4.445openalex-snapshot
A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-snapshot
Decomposition of Finite Graphs Into Forests
inferredcites →https://doi.org/10.4153/cjm-1962-060-4openalex-snapshot
The Construction of Certain Graphs
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(199703)24:3<205::aid-jgt2>3.0.co;2-topenalex-snapshot
Defective coloring revisited
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferred← citeshttps://doi.org/10.1002/jgt.21634openalex-snapshot
Destroying Noncomplete Regular Components in Graph Partitions
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_85openalex-snapshot
Approximation of Constraint Satisfaction via local search
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_14openalex-snapshot
Bipartizing with a Matching
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_30openalex-snapshot
Private Graph Colouring with Limited Defectiveness
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_4openalex-snapshot
Vertex-Coloring with Star-Defects
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_8openalex-snapshot
My Top 10 Graph Theory Conjectures and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_10openalex-snapshot
The Path Partition Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_71openalex-snapshot
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_32openalex-snapshot
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_21openalex-snapshot
Strong Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_24openalex-snapshot
Independent Sets in Bounded-Degree Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_14openalex-snapshot
Pairwise-Interaction Games
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_28openalex-snapshot
Grid Drawings and the Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_11openalex-snapshot
Erdős’s Work on Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-2900-5_3openalex-snapshot
About a Combinatorial Proof of the Noisy Channel Coding Theorem
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_9openalex-snapshot
True Embedding Partition Relations
inferred← citeshttps://doi.org/10.1007/bf01202473openalex-snapshot
Relaxed chromatic numbers of graphs
inferred← citeshttps://doi.org/10.1007/bf01872104openalex-snapshot
A consistent edge partition theorem for infinite graphs
inferred← citeshttps://doi.org/10.1007/bfb0053959openalex-snapshot
Approximations of independent sets in graphs
inferred← citeshttps://doi.org/10.1007/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferred← citeshttps://doi.org/10.1007/pl00007226openalex-snapshot
Colour Number, Capacity, and Perfectness of Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1270-zopenalex-snapshot
Solving Partition Problems with Colour-Bipartitions
inferred← citeshttps://doi.org/10.1007/s00453-007-0118-zopenalex-snapshot
The Consecutive Ones Submatrix Problem for Sparse Matrices
inferred← citeshttps://doi.org/10.1007/s00493-012-2710-3openalex-snapshot
On two problems in graph Ramsey theory
inferred← citeshttps://doi.org/10.1007/s10474-008-7160-4openalex-snapshot
A note on the Engelking-Karłowicz theorem
inferred← citeshttps://doi.org/10.1007/s10479-021-03966-9openalex-snapshot
On the computational complexity of the bipartizing matching problem
inferred← citeshttps://doi.org/10.1007/s10878-013-9664-2openalex-snapshot
Co-2-plex vertex partitions
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.1016/0012-365x(78)90049-3openalex-snapshot
A bound on the chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90102-4openalex-snapshot
Chromatic number, girth and maximal degree
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90167-xopenalex-snapshot
Another bound on the chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90148-7openalex-snapshot
Chromatic number of finite and infinite graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90122-7openalex-snapshot
Graph decomposition with constraints on the minimum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90142-8openalex-snapshot
Geometrical embeddings of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0205-iopenalex-snapshot
Vertex arboricity and maximum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90176-7openalex-snapshot
Graphical decompositions
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.aml.2011.02.003openalex-snapshot
A note on a cycle partition problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.11.006openalex-snapshot
Reprint of: Grid representations and the chromatic number
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.016openalex-snapshot
A hypocoloring model for batch scheduling
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.013openalex-snapshot
Independent sets in bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.029openalex-snapshot
On the existence of vertex-disjoint subgraphs with high degree sum
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.026openalex-snapshot
A comparison of integer programming models for the partial directed weighted improper coloring problem
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.016openalex-snapshot
Partitions of multigraphs under minimum degree constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.014openalex-snapshot
A note on partitions of graphs under degree constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.028openalex-snapshot
On a conjecture of Schweser and Stiebitz
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.010openalex-snapshot
List injective edge-coloring of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.012openalex-snapshot
Path partitions and Pn -free sets
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.065openalex-snapshot
The Path Partition Conjecture is true for claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.007openalex-snapshot
Operator decomposition of graphs and the reconstruction conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.011openalex-snapshot
Partitions of graphs into cographs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.10.014openalex-snapshot
The Path Partition Conjecture is true for some generalizations of tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.007openalex-snapshot
Partitioning and coloring graphs with degree constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.014openalex-snapshot
On 1 -improper 2 -coloring of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.024openalex-snapshot
The m -degenerate chromatic number of a digraph
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.026openalex-snapshot
Facially-constrained colorings of plane graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.015openalex-snapshot
On partitions of K2,3 -free graphs under degree constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111790openalex-snapshot
Relaxed equitable colorings of planar graphs with girth at least 8
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111828openalex-snapshot
Induced subgraphs with many repeated degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112637openalex-snapshot
Defective DP-colorings of sparse simple graphs
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.2022.113186openalex-snapshot
Generalized DP-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.09.006openalex-snapshot
Coloring a graph with Δ−1 colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103217openalex-snapshot
On 2-defective DP-colorings of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103267openalex-snapshot
Defective DP-colorings of sparse multigraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103355openalex-snapshot
Injective edge-coloring of graphs with given maximum degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103829openalex-snapshot
Majority choosability of countable graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.10.019openalex-snapshot
Satisfactory graph partition, variants, and generalizations
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.046openalex-snapshot
On a tree-partition problem
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.050openalex-snapshot
Vertex-disjoint subgraphs with high degree sums
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.076openalex-snapshot
Embedding graphs in Euclidean space
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.013openalex-snapshot
Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.007openalex-snapshot
Vertex coloring edge-weighted digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.08.004openalex-snapshot
2-subcoloring is NP-complete for planar comparability graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105146openalex-snapshot
Embedding graphs in Euclidean space
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.12.001openalex-snapshot
Relaxed two-coloring of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.01.004openalex-snapshot
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.08.003openalex-snapshot
Isomorphic bisections of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.010openalex-snapshot
Immersion and clustered coloring
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00177-8openalex-snapshot
Subcolorings and the subchromatic number of a graph
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00092-2openalex-snapshot
Generalized independence and domination in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00114-9openalex-snapshot
Graph partitions with minimum degree constraints
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00221-6openalex-snapshot
Variable degeneracy: extensions of Brooks’ and Gallai's theorems
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00006-0openalex-snapshot
Partitioning into graphs with only small components
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00031-5openalex-snapshot
Bounded size components—partitions and transversals
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00066-6openalex-snapshot
Path Partitions and Pn-free Sets
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00115-5openalex-snapshot
Partitions of Graphs into Cographs
inferred← citeshttps://doi.org/10.1017/cbo9780511566059.012openalex-snapshot
Problem Collection of the DIMANET Mátraháza Workshop, 22–28 October 1995
inferred← citeshttps://doi.org/10.1017/s096354830621808xopenalex-snapshot
Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004, 455pp., £73.00/$109.00/94.95 Euros
inferred← citeshttps://doi.org/10.1017/s0963548319000063openalex-snapshot
Defective and clustered choosability of sparse graphs
inferred← citeshttps://doi.org/10.1023/b:acom.0000032043.07621.62openalex-snapshot
Lagrange Interpolation by Bivariate C 1-Splines with Optimal Approximation Order
inferred← citeshttps://doi.org/10.1023/b:acom.0000032044.49282.8aopenalex-snapshot
Lagrange Interpolation by C 1 Cubic Splines on Triangulated Quadrangulations
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476560-xopenalex-snapshot
On the genus of graphs with Lick-White number 𝑘
inferred← citeshttps://doi.org/10.1090/s0002-9947-1985-0792827-8openalex-snapshot
Changing the Depth of an Ordered Set by Decomposition
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0936824-0openalex-snapshot
Embedding Graphs into Colored Graphs
inferred← citeshttps://doi.org/10.1109/focs.2015.84openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1109/tit.1981.1056281openalex-snapshot
Graph decomposition: A new key to coding theorems
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1970.tb45124.xopenalex-snapshot
PROBLEMS AND RESULTS IN FINITE AND INFINITE COMBINATORIAL ANALYSIS
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17768.xopenalex-snapshot
A SURVEY OF NONCOMPLETE RAMSEY THEORY FOR GRAPHS
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32789.xopenalex-snapshot
OLD AND NEW PROBLEMS IN COMBINATORIAL ANALYSIS AND GRAPH THEORY
inferred← citeshttps://doi.org/10.1112/blms/14.3.177openalex-snapshot
A Glance at Graph Theory-Part I
inferred← citeshttps://doi.org/10.1145/254180.254190openalex-snapshot
A survey of approximately optimal solutions to some covering and packing problems
inferred← citeshttps://doi.org/10.1145/3088513openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1145/3357713.3384298openalex-snapshot
Polylogarithmic-time deterministic network decomposition and distributed derandomization
inferred← citeshttps://doi.org/10.1515/dma.2009.036openalex-snapshot
Nondegenerate colourings in the Brooks theorem
inferred← citeshttps://doi.org/10.1515/math-2017-0098openalex-snapshot
Coloring subgraphs with restricted amounts of hues
inferred← citeshttps://doi.org/10.26708/ijmsc.2015.2.5.13openalex-snapshot
Ascending Domination Decomposition of Subdivision of Graphs
inferred← citeshttps://doi.org/10.37236/1945openalex-snapshot
An Asymptotic Result for the Path Partition Conjecture
inferred← citeshttps://doi.org/10.3929/ethz-a-005664983openalex-snapshot
Colorings and transversals of graphs
inferred← citeshttps://doi.org/10.4213/dm1076openalex-snapshot
Невырожденные раскраски в теореме Брукса
inferred← citeshttps://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06285openalex-snapshot
A transference principle for Ramsey numbers of bounded degree graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1509.00099openalex-snapshot
Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01283openalex-snapshot
2-subcoloring is NP-complete for planar comparability graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01442openalex-snapshot
Colorings with Fractional Defect
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08502openalex-snapshot
Partitions of multigraphs under degree constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06149openalex-snapshot
A note on choosability with defect 1 of graphs on surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.2103.07913openalex-snapshot
Factorizations of regular graphs of infinite degree
inferred← citeshttps://doi.org/10.48550/arxiv.2109.05255openalex-snapshot
Exact defective colorings of graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2021.9.1.1openalex-snapshot
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1037openalex-snapshot
A survey of hereditary properties of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1095openalex-snapshot
Generalized Ramsey theory and decomposable properties of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1174openalex-snapshot
Generalized chromatic numbers and additive hereditary properties of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1673openalex-snapshot
A survey of the Path Partition Conjecture
inferred← citeshttps://doi.org/10.7151/dmgt.2383openalex-snapshot
Countable graphs are majority 3-choosable
inferred← citeshttps://doi.org/10.7155/jgaa.00003openalex-snapshot
Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
inferred← citeshttps://doi.org/10.7155/jgaa.00141openalex-snapshot
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
inferred← citeshttps://doi.org/10.71781/15128openalex-snapshot
La conjecture de partitionnement des chemins
inferred← citeshttps://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi
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.