On the public citation graph
The Many Facets of Graph Theory
0 signed · 126 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/bfb0060108openalex-snapshot
On the number of cycles in permutation graphs
inferredcites →https://doi.org/10.1007/bfb0060112openalex-snapshot
A many-facetted problem of zarankiewicz
inferredcites →https://doi.org/10.1007/bfb0060115openalex-snapshot
On classes of graphs defined by special cutsets of lines
inferredcites →https://doi.org/10.1007/bfb0060125openalex-snapshot
Methods for the enumeration of multigraphs
inferredcites →https://doi.org/10.1007/bfb0060128openalex-snapshot
An application of graph theory to social psychology
inferredcites →https://doi.org/10.1007/bfb0060129openalex-snapshot
A topological influence: Homeomorphically irreducible 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/malq.19780241905openalex-snapshot
L'Indeformabilite des Relations et Multirelations Binaires
inferred← citeshttps://doi.org/10.1002/net.3230110304openalex-snapshot
Networks immune to isolated failures
inferred← citeshttps://doi.org/10.1006/eujc.2001.0517openalex-snapshot
An Ore-type Condition for Cyclability
inferred← citeshttps://doi.org/10.1006/geno.2000.6187openalex-snapshot
An Algorithm for Clustering cDNA Fingerprints
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_35openalex-snapshot
Triangle-Free Planar Graphs as Segments Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_35openalex-snapshot
A Note on the Line Reconstruction Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_17openalex-snapshot
The Krausz Dimension of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-322-83173-6_3openalex-snapshot
Wohlüberlegtes Puzzle-Spiel
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_3openalex-snapshot
The Tutte Polynomial Part I: General Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_23openalex-snapshot
Ordered Sets and Social Sciences
inferred← citeshttps://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
inferred← citeshttps://doi.org/10.1007/bf02771220openalex-snapshot
Some analogues of eberhard’s theorem on convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02995910openalex-snapshot
Unendliche minimalen-fach zusammenhängende Graphen
inferred← citeshttps://doi.org/10.1007/bfb0066176openalex-snapshot
The coloring numbers of the direct product of two hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0066191openalex-snapshot
On the chromatic number of the direct product of hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0066195openalex-snapshot
Aspects of the theory of hypermatroids
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1007/bfb0070394openalex-snapshot
Subgraph connectivity numbers of a graph
inferred← citeshttps://doi.org/10.1007/bfb0070398openalex-snapshot
The minimum degree and connectivity of a graph
inferred← citeshttps://doi.org/10.1007/s00373-006-0649-0openalex-snapshot
Toughness in Graphs – A Survey
inferred← citeshttps://doi.org/10.1007/s10878-007-9059-3openalex-snapshot
Hamiltonicity of hypercubes with a constraint of required and faulty edges
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90007-6openalex-snapshot
Reconstruction of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90081-7openalex-snapshot
On the automorphism group of a matroid
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90075-7openalex-snapshot
Further characterizations of cubic lattice graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90150-2openalex-snapshot
Two characterizations of interchange graphs of complete m-partite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90105-3openalex-snapshot
Partition of the edges of the directed complete graph into 4-cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90078-9openalex-snapshot
A method in graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90179-5openalex-snapshot
Search for minimal trivalent cycle permutation graphs with girth nine
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90084-xopenalex-snapshot
Arc-disjoint circuits in digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90193-5openalex-snapshot
On k-path hamiltonian maximal planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90060-3openalex-snapshot
On the chromatic number of certain highly symmetric graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90035-gopenalex-snapshot
Reconstructing degree sequences from k-vertex-deleted subgraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90159-fopenalex-snapshot
Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90352-3openalex-snapshot
Stable properties of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00293-ropenalex-snapshot
The 24 symmetry pairings of self-dual maps on the sphere
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90255-0openalex-snapshot
The total chromatic number of regular graphs whose complement is bipartite
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00057-4openalex-snapshot
Hamiltonian circuits in chordal bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00190-8openalex-snapshot
Toughness, hamiltonicity and split graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90021-6openalex-snapshot
Bounds for 3-matroid intersection problems
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90011-4openalex-snapshot
An n log n algorithm for determining the congruity of polyhedra
inferred← citeshttps://doi.org/10.1016/0022-247x(72)90030-3openalex-snapshot
A characterisation of binary transversal structures
inferred← citeshttps://doi.org/10.1016/0022-247x(73)90124-8openalex-snapshot
A property of the hyperplanes of a matroid and an extension of Dilworth's theorem
inferred← citeshttps://doi.org/10.1016/0022-247x(79)90108-2openalex-snapshot
The rigidity of graphs, II
inferred← citeshttps://doi.org/10.1016/0022-2496(87)90026-5openalex-snapshot
From a line drawing to a polyhedron
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90068-8openalex-snapshot
A note on the line reconstruction problem
inferred← citeshttps://doi.org/10.1016/0095-8956(73)90028-2openalex-snapshot
Reconstructing the degree pair sequence of a digraph
inferred← citeshttps://doi.org/10.1016/0095-8956(73)90055-5openalex-snapshot
Fixing subgraphs and Ulam's conjecture
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90066-5openalex-snapshot
The reconstruction of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90083-5openalex-snapshot
Higher-dimensional tree structures
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90097-5openalex-snapshot
Inequalities for the chromatic numbers of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90056-3openalex-snapshot
On reconstructing graphs from their sets of subgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90026-0openalex-snapshot
A product of matroids and its automorphism group
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90049-1openalex-snapshot
Comparability graphs and a new matroid
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90074-0openalex-snapshot
The edge reconstruction hypothesis is true for graphs with more than n · log2n edges
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90038-2openalex-snapshot
Deformations of plane graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90057-1openalex-snapshot
A refinement of Kuratowski's theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90074-2openalex-snapshot
Minimally 3-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90043-jopenalex-snapshot
Generating projective plane polyhedral maps
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90004-hopenalex-snapshot
Edge reductions in cyclically k-connected cubic graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(73)90012-5openalex-snapshot
Shortness exponents of families of graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90249-aopenalex-snapshot
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
inferred← citeshttps://doi.org/10.1016/0315-0860(77)90113-6openalex-snapshot
On “The Tantalizer” and “Instant Insanity”
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2262-7.50010-7openalex-snapshot
Line-minimal Graphs with Cyclic Group††Work supported in part by National Research Council of Canada grant A7332, and in part by the Chilean government (law 11575).
inferred← citeshttps://doi.org/10.1016/j.aam.2016.01.006openalex-snapshot
The binary matroids whose only odd circuits are triangles
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127576openalex-snapshot
Multicolor bipartite Ramsey numbers for quadrilaterals and stars
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.015openalex-snapshot
The minimum number of minimal codewords in an [n,k] -code and in graphic codes
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.007openalex-snapshot
Probabilistic properties of highly connected random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.003openalex-snapshot
On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.011openalex-snapshot
Bounding ℓ -edge-connectivity in edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.008openalex-snapshot
A survey on the vertex-(edge-) k -maximal graphs and the k -vertex-(edge-)connected graphs with redundant subgraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.094openalex-snapshot
Pancyclic graphs and linear forests
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.005openalex-snapshot
Removable edges in a k -connected graph and a construction method for k -connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.025openalex-snapshot
A note on traversing specified vertices in graphs embedded with large representativity
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.023openalex-snapshot
Locally finite graphs with ends: A topological approach, I. Basic theory
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.027openalex-snapshot
Locally finite graphs with ends: A topological approach, II. Applications
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.032openalex-snapshot
A degree condition for cycles of maximum length in bipartite digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113692openalex-snapshot
Hamilton cycles passing through a matching in a bipartite graph with high degree sum
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.030openalex-snapshot
A survey on Hamilton cycles in directed graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.06.007openalex-snapshot
Set systems and families of permutations with small traces
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.045openalex-snapshot
Packing and covering with linear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.041openalex-snapshot
Finding maximum subgraphs with relatively large vertex connectivity
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.057openalex-snapshot
Degree sequences forcing Hamilton cycles in directed graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.11.004openalex-snapshot
Hamiltonian degree sequences in digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.007openalex-snapshot
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2004.02.030openalex-snapshot
Combinatorial structures associated with Lie algebras of finite dimension
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00180-8openalex-snapshot
Multidimensional bipartite trees
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00294-2openalex-snapshot
On the extension of a partial metric to a tree metric
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00341-xopenalex-snapshot
On the characteristic polynomial of homeomorphic images of a graph
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00032-0openalex-snapshot
The centroidal branches of a separable graph are edge reconstructible
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00243-4openalex-snapshot
Contractible circuits in 3-connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00073-9openalex-snapshot
On some relations between 2-trees and tree metrics
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00142-3openalex-snapshot
A clustering algorithm based on graph connectivity
inferred← citeshttps://doi.org/10.1016/s0166-218x(87)80001-xopenalex-snapshot
Graphical partially ordered sets
inferred← citeshttps://doi.org/10.1016/s0166-218x(87)80003-3openalex-snapshot
Bipartite permutation graphs
inferred← citeshttps://doi.org/10.1017/s0004972700023613openalex-snapshot
A note on the edge reconstruction conjecture
inferred← citeshttps://doi.org/10.1017/s000497270004065xopenalex-snapshot
On the edge-reconstruction of graphs
inferred← citeshttps://doi.org/10.1017/s0017089500003323openalex-snapshot
A bipartite Ramsey problem and the Zarankiewicz numbers
inferred← citeshttps://doi.org/10.1080/0025570x.1971.11976153openalex-snapshot
On Reconstruction of Matrices
inferred← citeshttps://doi.org/10.1103/physrevlett.105.020402openalex-snapshot
Rearranging the Exponential Wall for Large N -Body Systems
inferred← citeshttps://doi.org/10.1109/tsmc.1976.4309487openalex-snapshot
Observations of Control System Design: Problems and Promise
inferred← citeshttps://doi.org/10.1112/s0025579300008500openalex-snapshot
Properties and characterizations of k ‐trees
inferred← citeshttps://doi.org/10.2307/1956546openalex-snapshot
Schema Theory: An Information Processing Model of Perception and Cognition
inferred← citeshttps://doi.org/10.32469/10355/37801openalex-snapshot
Fusion frame constructions and frame partitions
inferred← citeshttps://doi.org/10.5860/choice.41-2860openalex-snapshot
Topics in graph automorphisms and reconstruction
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.