On the Nash-Williams' lemma in graph reconstruction theory
From MaRDI portal
Publication:1325266
DOI10.1006/jctb.1993.1044zbMath0794.05096OpenAlexW1985781995MaRDI QIDQ1325266
Publication date: 24 May 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/463dca05e3d4f9dcbe20ba22840c530518910afc
digraphstournamentsgraph reconstructionvertex reconstruction problemedge reconstructibilityNash-Williams' lemma
Related Items
Finite-type invariants for graphs and graph reconstructions, A survey on edge reconstruction of graphs, Chromatic polynomial, \(q\)-binomial counting and colored Jones function, Some results and approaches for reconstruction conjectures