On the public citation graph
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number
0 signed · 42 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/jgt.22360openalex-snapshot
Subdivisions of oriented cycles in digraphs with large chromatic number
inferredcites →https://doi.org/10.1002/mana.19740640109openalex-snapshot
Some Homeomorphism Properties of Graphs
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/bf02579379openalex-snapshot
Degree and local connectivity in digraphs
inferredcites →https://doi.org/10.1016/0024-3795(86)90179-5openalex-snapshot
Sign-nonsingular matrices and even cycles in directed graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90061-xopenalex-snapshot
Characterization of even directed graphs
inferredcites →https://doi.org/10.1016/j.disc.2013.01.011openalex-snapshot
Oriented trees in digraphs
inferredcites →https://doi.org/10.1016/j.ejc.2012.02.002openalex-snapshot
Immersing complete digraphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00088-1openalex-snapshot
Short proof of Menger's Theorem
inferredcites →https://doi.org/10.1017/s096354830000184xopenalex-snapshot
Topological cliques in graphs II
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22479.xopenalex-snapshot
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number
inferredcites →https://doi.org/10.4153/cmb-1982-017-4openalex-snapshot
Antidirected Subtrees of Directed Graphs
inferredcites →https://doi.org/10.4230/lipics.stacs.2018.7openalex-snapshot
Erdös-Pósa Property of Obstructions to Interval 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/jgt.22844openalex-snapshot
Complete directed minors and chromatic number
inferred← citeshttps://doi.org/10.1002/jgt.22920openalex-snapshot
On coloring digraphs with forbidden induced subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.23020openalex-snapshot
Subdivisions with congruence constraints in digraphs of large chromatic number
inferred← citeshttps://doi.org/10.1007/s00224-022-10103-xopenalex-snapshot
Digraph Coloring and Distance to Acyclicity
inferred← citeshttps://doi.org/10.1007/s00373-026-03031-xopenalex-snapshot
On a Variant of Dichromatic Number for Digraphs with Prescribed Sets of Arcs
inferred← citeshttps://doi.org/10.1007/s00493-021-4750-zopenalex-snapshot
Oriented Cycles in Digraphs of Large Outdegree
inferred← citeshttps://doi.org/10.1016/j.amc.2023.127968openalex-snapshot
Some mader-perfect graph classes
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.003openalex-snapshot
A note on coloring digraphs of large girth
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.020openalex-snapshot
Acyclic coloring of products of digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.003openalex-snapshot
Tightening the girth bound for C(k,k) subdivisions in digraphs with minimum out-degree two
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113193openalex-snapshot
Four proofs of the directed Brooks' Theorem
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103591openalex-snapshot
Decomposing and colouring some locally semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104022openalex-snapshot
Subdivisions in dicritical digraphs with large order or digirth
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.10.002openalex-snapshot
Dichromatic number and forced subdivisions
inferred← citeshttps://doi.org/10.1017/9781009490559.010openalex-snapshot
Oriented Trees and Paths in Digraphs
inferred← citeshttps://doi.org/10.1017/s0963548321000390openalex-snapshot
Strong complete minors in digraphs
inferred← citeshttps://doi.org/10.1017/s0963548324000038openalex-snapshot
Antidirected subgraphs of oriented graphs
inferred← citeshttps://doi.org/10.11606/t.45.2017.tde-23052017-100619openalex-snapshot
Graph colorings and digraph subdivisions
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-11openalex-snapshot
A Note on Graphs of Dichromatic Number 2
inferred← citeshttps://doi.org/10.37236/6922openalex-snapshot
Bispindles in Strongly Connected Digraphs with Large Chromatic Number
inferred← citeshttps://doi.org/10.37236/9906openalex-snapshot
Extension of Gyárfás-Sumner Conjecture to Digraphs
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-113openalex-snapshot
Semidegree, edge density and antidirected subgraphs
inferred← citeshttps://doi.org/10.70675/80f73784z475az47adzb2ccz764d88c268e2openalex-snapshot
Contributions to approximation and parameterization in combinatorial optimization
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.