On the public citation graph
A generalization of Kónig's theorem
0 signed · 74 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/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot
On chromatic number of graphs and set systems
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.20180openalex-snapshot
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1006/eujc.1999.0330openalex-snapshot
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_40openalex-snapshot
Distributed Reconfiguration of Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_9openalex-snapshot
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_6openalex-snapshot
A Survey on Covering Supermodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_4openalex-snapshot
Variations for Lovász’ Submodular Ideas
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_29openalex-snapshot
A Linear Vertex Kernel for Maximum Internal Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_2openalex-snapshot
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/s00373-008-0804-xopenalex-snapshot
Packing Trees with Constraints on the Leaf Degree
inferred← citeshttps://doi.org/10.1007/s00493-011-2960-3openalex-snapshot
Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
inferred← citeshttps://doi.org/10.1007/s00493-014-2960-3openalex-snapshot
Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferred← citeshttps://doi.org/10.1016/0097-3165(86)90060-9openalex-snapshot
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.005openalex-snapshot
Spanning tree with lower bound on the degrees
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.10.002openalex-snapshot
Computing minimum multiway cuts in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.12.018openalex-snapshot
Sparse hypergraphs and pebble game algorithms
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103212openalex-snapshot
Packing branchings under cardinality constraints on their root sets
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.03.004openalex-snapshot
A linear vertex kernel for maximum internal spanning tree
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.05.001openalex-snapshot
Edge-partitioning 3-edge-connected graphs into paths
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00463-8openalex-snapshot
On decomposing a hypergraph into k connected sub-hypergraphs
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1070/rm2011v066n05abeh004764openalex-snapshot
The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
inferred← citeshttps://doi.org/10.1070/rm9905openalex-snapshot
Extremal problems in hypergraph colourings
inferred← citeshttps://doi.org/10.1109/tsmc.2025.3549602openalex-snapshot
Group Multirole Assignment With General Conflict
inferred← citeshttps://doi.org/10.1137/20m1385615openalex-snapshot
List Coloring of Two Matroids through Reduction to Partition Matroids
inferred← citeshttps://doi.org/10.11606/d.45.2009.tde-03112010-231536openalex-snapshot
Minimização de funções submodulares
inferred← citeshttps://doi.org/10.1287/moor.2017.0881openalex-snapshot
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
inferred← citeshttps://doi.org/10.4213/rm9443openalex-snapshot
Задача Эрдеша - Хайнала о раскрасках гиперграфов, ее обобщения и смежные проблемы
inferred← citeshttps://doi.org/10.4213/rm9905openalex-snapshot
Экстремальные задачи в раскрасках гиперграфов
inferred← citeshttps://doi.org/10.48550/arxiv.0907.3208openalex-snapshot
A Linear Vertex Kernel for Maximum Internal Spanning Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1609.09684openalex-snapshot
Thoroughly Distributed Colorings
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.