On the public citation graph

Proof Techniques in Graph Theory

https://doi.org/10.2307/2004649

0 signed · 378 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.

Claim with ORCID

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.

See reference health

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(199907)31:3<155::aid-jgt1>3.0.co;2-ropenalex-snapshot

A characterization ofP4-indifference graphs

inferred← citeshttps://doi.org/10.1002/(sici)1099-1360(199606)5:2<81::aid-mcda101>3.0.co;2-vopenalex-snapshot

Preference Structures and Co-comparability Graphs

inferred← citeshttps://doi.org/10.1002/0471214426.pas0401openalex-snapshot

Representational Measurement Theory

inferred← citeshttps://doi.org/10.1002/9781118032497.ch7openalex-snapshot

Sparse Graphs

inferred← citeshttps://doi.org/10.1002/9783527627981.ch1openalex-snapshot

Entropy, Orbits, and Spectra of Graphs

inferred← citeshttps://doi.org/10.1002/jgt.20415openalex-snapshot

Families of pairs of graphs with a large number of common cards

inferred← citeshttps://doi.org/10.1002/jgt.21650openalex-snapshot

Unit Interval Graphs of Open and Closed Intervals

inferred← citeshttps://doi.org/10.1002/jgt.21795openalex-snapshot

Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number

inferred← citeshttps://doi.org/10.1002/jgt.21831openalex-snapshot

A Characterization of Mixed Unit Interval Graphs

inferred← citeshttps://doi.org/10.1002/jgt.22111openalex-snapshot

Bounding the Clique‐Width of H ‐Free Chordal Graphs

inferred← citeshttps://doi.org/10.1002/jgt.22571openalex-snapshot

Fractional chromatic number of a random subgraph

inferred← citeshttps://doi.org/10.1002/jgt.22929openalex-snapshot

A new graph parameter to measure linearity

inferred← citeshttps://doi.org/10.1002/jgt.3190010105openalex-snapshot

A note of welcome

inferred← citeshttps://doi.org/10.1002/jgt.3190010209openalex-snapshot

Total matchings and total coverings of graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190010406openalex-snapshot

The number of self‐complementary achiral necklaces

inferred← citeshttps://doi.org/10.1002/jgt.3190020105openalex-snapshot

Nearly acyclic graphs are reconstructible

inferred← citeshttps://doi.org/10.1002/jgt.3190020202openalex-snapshot

A bibliographic survey of edge‐colorings

inferred← citeshttps://doi.org/10.1002/jgt.3190040202openalex-snapshot

Enumeration of weak isomorphism classes of signed graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190050109openalex-snapshot

A note on constructive methods for ramsey numbers

inferred← citeshttps://doi.org/10.1002/jgt.3190060307openalex-snapshot

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190080408openalex-snapshot

Diameter bounds for altered graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190090405openalex-snapshot

Classes of interval graphs under expanding length restrictions

inferred← citeshttps://doi.org/10.1002/jgt.3190100306openalex-snapshot

An Eulerian exposition

inferred← citeshttps://doi.org/10.1002/jgt.3190150508openalex-snapshot

Covering the edges with consecutive sets

inferred← citeshttps://doi.org/10.1002/jgt.3190170602openalex-snapshot

Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture

inferred← citeshttps://doi.org/10.1002/jgt.3190200312openalex-snapshot

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

inferred← citeshttps://doi.org/10.1002/net.3230020103openalex-snapshot

Partial orders of dimension 2

inferred← citeshttps://doi.org/10.1002/net.3230070305openalex-snapshot

Towards a theory of domination in graphs

inferred← citeshttps://doi.org/10.1002/net.3230080308openalex-snapshot

Permutation layout

inferred← citeshttps://doi.org/10.1006/aama.2001.0771openalex-snapshot

The Specification of 2-trees

inferred← citeshttps://doi.org/10.1007/11562436_33openalex-snapshot

Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks

inferred← citeshttps://doi.org/10.1007/11847250_15openalex-snapshot

Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs

inferred← citeshttps://doi.org/10.1007/3-540-44541-2_31openalex-snapshot

Unavoidable Configurations in Complete Topological Graphs

inferred← citeshttps://doi.org/10.1007/3-540-44842-x_91openalex-snapshot

Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole

inferred← citeshttps://doi.org/10.1007/3-540-48481-7_46openalex-snapshot

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot

On the complexity of graph reconstruction

inferred← citeshttps://doi.org/10.1007/3-540-60313-1_140openalex-snapshot

Interval graphs with side (and size) constraints

inferred← citeshttps://doi.org/10.1007/3-540-60313-1_161openalex-snapshot

Approximating the bandwidth for asteroidal triple-free graphs

inferred← citeshttps://doi.org/10.1007/3-540-61576-8_71openalex-snapshot

Connected proper interval graphs and the guard problem in spiral polygons

inferred← citeshttps://doi.org/10.1007/3-540-63397-9_29openalex-snapshot

Dynamic storage allocation with known durations

inferred← citeshttps://doi.org/10.1007/978-1-4020-9783-6openalex-snapshot

Recent Advances in QSAR Studies

inferred← citeshttps://doi.org/10.1007/978-1-4471-2173-2_2openalex-snapshot

Overture: Ramsey’s Theorem

inferred← citeshttps://doi.org/10.1007/978-1-4612-2234-7_18openalex-snapshot

A Unified Approach to the Reliability of Recurrent Structures

inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_1openalex-snapshot

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: Seven Fundamental Ideas

inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_12openalex-snapshot

Meaningless Statements, Matching Experiments, and Colored Digraphs

inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_3openalex-snapshot

Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries

inferred← citeshttps://doi.org/10.1007/978-3-030-22868-2_5openalex-snapshot

Characterization and Recognition of Proper Tagged Probe Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-52213-0_20openalex-snapshot

The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability

inferred← citeshttps://doi.org/10.1007/978-3-031-84128-6_4openalex-snapshot

Convex Geometries in Graphs

inferred← citeshttps://doi.org/10.1007/978-3-0348-7246-1_15openalex-snapshot

Der Wettlauf um die Lösung (1973 –1976)

inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_26openalex-snapshot

Four Floors for the Theory of Theory Change: The Case of Imperfect Discrimination

inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_27openalex-snapshot

A Characterization of Mixed Unit Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_10openalex-snapshot

Separator Theorems for Interval Graphs and Proper Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_30openalex-snapshot

Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-95349-6_7openalex-snapshot

Binomial Edge Ideals and Related Ideals

inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_1openalex-snapshot

Lexicographic Breadth First Search – A Survey

inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_25openalex-snapshot

Optimal Distance Labeling for Interval and Circular-Arc Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_8openalex-snapshot

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_23openalex-snapshot

Crossing Numbers

inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_22openalex-snapshot

The Maximum Solution Problem on Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_32openalex-snapshot

On the Query Complexity of Testing Orientations for Being Eulerian

inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_72openalex-snapshot

Bandwidth of Bipartite Permutation Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_16openalex-snapshot

Random Generation and Enumeration of Proper Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_21openalex-snapshot

The Crossing Number of Graphs: Theory and Computation

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_111openalex-snapshot

Random Generation and Enumeration of Bipartite Permutation Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_26openalex-snapshot

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width

inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_22openalex-snapshot

Measuring Indifference: Unit Interval Vertex Deletion

inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_29openalex-snapshot

Bipartite Permutation Graphs Are Reconstructible

inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_34openalex-snapshot

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_8openalex-snapshot

Densest k-Subgraph Approximation on Intersection Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_18openalex-snapshot

Computing Role Assignments of Proper Interval Graphs in Polynomial Time

inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_27openalex-snapshot

Monotone Crossing Number

inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_29openalex-snapshot

On the Recognition of k-Equistable Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot

Recent Developments in Combinatorial Geometry

inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_13openalex-snapshot

Set Theoretic Constructions in Euclidean Spaces

inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_6openalex-snapshot

Constructive Ramsey Bounds and Intersection Theorems for Sets

inferred← citeshttps://doi.org/10.1007/978-3-642-93069-0_7openalex-snapshot

Literature

inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_18openalex-snapshot

Specifying 2-trees

inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_25openalex-snapshot

Unit Interval Editing is Fixed-Parameter Tractable

inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_12openalex-snapshot

Generating Graphs Uniformly at Random

inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_11openalex-snapshot

Partial Orders and Euclidean Geometry

inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_11openalex-snapshot

Issues in the Theory of Uniqueness in Measurement

inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-94-009-6309-2_4openalex-snapshot

Controlled-Error Theories of Proximity and Dominance

inferred← citeshttps://doi.org/10.1007/bf00136119openalex-snapshot

An exact philosophy of inexactness

inferred← citeshttps://doi.org/10.1007/bf01190897openalex-snapshot

Efficient parallel recognition of some circular arc graphs, I

inferred← citeshttps://doi.org/10.1007/bf01473611openalex-snapshot

Just two total graphs are complementary

inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot

On the complexity of graph reconstruction

inferred← citeshttps://doi.org/10.1007/bf01584076openalex-snapshot

Some problems in discrete optimization

inferred← citeshttps://doi.org/10.1007/bf01788558openalex-snapshot

Line domination in graphs

inferred← citeshttps://doi.org/10.1007/bf01788656openalex-snapshot

On dimensional properties of graphs

inferred← citeshttps://doi.org/10.1007/bf01901979openalex-snapshot

Automorphism group and category of cospectral graphs

inferred← citeshttps://doi.org/10.1007/bf01934264openalex-snapshot

Finding minimum height elimination trees for interval graphs in polynomial time

inferred← citeshttps://doi.org/10.1007/bf02187793openalex-snapshot

Countable decompositions ofR 2 andR 3

inferred← citeshttps://doi.org/10.1007/bf02392038openalex-snapshot

Enumeration under two representations of the wreath product

inferred← citeshttps://doi.org/10.1007/bf02575536openalex-snapshot

Some quasi-ordered classes of finite commutative semigroups

inferred← citeshttps://doi.org/10.1007/bf02579254openalex-snapshot

On well-quasi-ordering-finite graphs by immersion

inferred← citeshttps://doi.org/10.1007/bf02579457openalex-snapshot

Intersection theorems with geometric consequences

inferred← citeshttps://doi.org/10.1007/bf02584056openalex-snapshot

Łukasiewicz logic and the foundations of measurement

inferred← citeshttps://doi.org/10.1007/bf02834761openalex-snapshot

Edge sets contained in circuits

inferred← citeshttps://doi.org/10.1007/bf02924814openalex-snapshot

Geometria combinatoria e geometrie finite

inferred← citeshttps://doi.org/10.1007/bfb0019424openalex-snapshot

Intervals and orders: What comes after interval orders?

inferred← citeshttps://doi.org/10.1007/bfb0021793openalex-snapshot

On the complexity of recognizing intersection and touching graphs of disks

inferred← citeshttps://doi.org/10.1007/bfb0059421openalex-snapshot

On connected cubic graphs and trivalent trees

inferred← citeshttps://doi.org/10.1007/bfb0060115openalex-snapshot

On classes of graphs defined by special cutsets of lines

inferred← citeshttps://doi.org/10.1007/bfb0060119openalex-snapshot

On reconstruction of graphs

inferred← citeshttps://doi.org/10.1007/bfb0062511openalex-snapshot

Reflections on the legitimate deck problem

inferred← citeshttps://doi.org/10.1007/bfb0062528openalex-snapshot

Graphs, groups and polytopes

inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot

A survey of the reconstruction conjecture

inferred← citeshttps://doi.org/10.1007/bfb0066434openalex-snapshot

Which graphs have integral spectra?

inferred← citeshttps://doi.org/10.1007/bfb0066441openalex-snapshot

Chromatically equivalent graphs

inferred← citeshttps://doi.org/10.1007/bfb0067363openalex-snapshot

Crossing numbers of graphs

inferred← citeshttps://doi.org/10.1007/bfb0069184openalex-snapshot

The spectrum of a graph

inferred← citeshttps://doi.org/10.1007/bfb0070412openalex-snapshot

Circular arc graphs: New uses and a new algorithm

inferred← citeshttps://doi.org/10.1007/s00026-011-0117-2openalex-snapshot

Minimal Classes of Graphs of Unbounded Clique-Width

inferred← citeshttps://doi.org/10.1007/s00283-009-9120-4openalex-snapshot

The Early History of the Brick Factory Problem

inferred← citeshttps://doi.org/10.1007/s00373-021-02303-yopenalex-snapshot

The Conjecture on the Crossing Number of $$K_{1,m,n}$$ is true if Zarankiewicz’s Conjecture Holds

inferred← citeshttps://doi.org/10.1007/s00373-022-02538-3openalex-snapshot

The Crossing Number of Twisted Graphs

inferred← citeshttps://doi.org/10.1007/s00453-010-9468-zopenalex-snapshot

The k-in-a-Path Problem for Claw-free Graphs

inferred← citeshttps://doi.org/10.1007/s00453-012-9661-3openalex-snapshot

Proper Interval Vertex Deletion

inferred← citeshttps://doi.org/10.1007/s00453-016-0133-zopenalex-snapshot

Extending Partial Representations of Proper and Unit Interval Graphs

inferred← citeshttps://doi.org/10.1007/s00453-018-0440-7openalex-snapshot

Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs

inferred← citeshttps://doi.org/10.1007/s00453-019-00599-0openalex-snapshot

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue

inferred← citeshttps://doi.org/10.1007/s00453-020-00710-wopenalex-snapshot

Succinct Encodings for Families of Interval Graphs

inferred← citeshttps://doi.org/10.1007/s00453-025-01296-xopenalex-snapshot

Simultaneous Representation of Proper and Unit Interval Graphs

inferred← citeshttps://doi.org/10.1007/s00454-009-9228-5openalex-snapshot

The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

inferred← citeshttps://doi.org/10.1007/s10878-022-00953-zopenalex-snapshot

The weighted sitting closer to friends than enemies problem in the line

inferred← citeshttps://doi.org/10.1007/s11083-006-9029-xopenalex-snapshot

Non-Unit Free Triangle Orders

inferred← citeshttps://doi.org/10.1007/s11083-006-9031-3openalex-snapshot

A Finite Non-Unit Free Triangle Order

inferred← citeshttps://doi.org/10.1007/s11083-008-9091-7openalex-snapshot

Unit and Proper Tube Orders

inferred← citeshttps://doi.org/10.1007/s11083-010-9188-7openalex-snapshot

Canonical Antichains of Unit Interval and Bipartite Permutation Graphs

inferred← citeshttps://doi.org/10.1007/s11083-011-9197-1openalex-snapshot

On-Line Chain Partitions of Orders: A Survey

inferred← citeshttps://doi.org/10.1007/s11227-020-03512-7openalex-snapshot

A sufficient condition for the unpaired k-disjoint path coverability of interval graphs

inferred← citeshttps://doi.org/10.1007/s11425-007-0069-5openalex-snapshot

Results of the maximum genus of graphs

inferred← citeshttps://doi.org/10.1007/s11856-012-0145-6openalex-snapshot

The list-chromatic number of infinite graphs

inferred← citeshttps://doi.org/10.1007/s12190-014-0755-8openalex-snapshot

On the geodetic number of permutation graphs

inferred← citeshttps://doi.org/10.1007/s12190-020-01318-7openalex-snapshot

A note on the minimum edge dominating energy of graphs

inferred← citeshttps://doi.org/10.1007/s13173-011-0047-1openalex-snapshot

The interval count of interval graphs and orders: a short survey

inferred← citeshttps://doi.org/10.1016/0001-8708(77)90061-5openalex-snapshot

Geometric coloring theory

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)90009-xopenalex-snapshot

Lower bounds for some Ramsey numbers

inferred← citeshttps://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot

A characterisation of rigid circuit graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(75)90021-7openalex-snapshot

A recognition algorithm for the intersection graphs of directed paths in directed trees

inferred← citeshttps://doi.org/10.1016/0012-365x(82)90058-9openalex-snapshot

Enumeration of labelled multigraphs by degree parities

inferred← citeshttps://doi.org/10.1016/0012-365x(82)90184-4openalex-snapshot

The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph

inferred← citeshttps://doi.org/10.1016/0012-365x(83)90099-7openalex-snapshot

Reconstructibility and perfect graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(85)90042-1openalex-snapshot

Interval graphs and interval orders

inferred← citeshttps://doi.org/10.1016/0012-365x(88)90015-5openalex-snapshot

A combinatorial result on points and circles on the plane

inferred← citeshttps://doi.org/10.1016/0012-365x(89)90196-9openalex-snapshot

The subchromatic number of a graph

inferred← citeshttps://doi.org/10.1016/0012-365x(89)90271-9openalex-snapshot

A characterization of interval catch digraphs

inferred← citeshttps://doi.org/10.1016/0012-365x(90)90280-uopenalex-snapshot

Hadwiger's conjecture for graphs on the Klein bottle

inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot

Bibliography on domination in graphs and some basic definitions of domination parameters

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90135-3openalex-snapshot

A new characterization of proper interval graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(93)90121-9openalex-snapshot

Interval competition graphs of symmetric diagraphs

inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0182-4openalex-snapshot

On edge transitivity of directed graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(94)00190-topenalex-snapshot

Size in maximal triangle-free graphs and minimal graphs of diameter 2

inferred← citeshttps://doi.org/10.1016/0012-365x(94)90130-9openalex-snapshot

On chordal proper circular arc graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(83)90078-9openalex-snapshot

Finding Hamiltonian circuits in proper interval graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(95)00046-fopenalex-snapshot

Simple linear time recognition of unit interval graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(95)00133-wopenalex-snapshot

A linear-time algorithm for proper interval graph recognition

inferred← citeshttps://doi.org/10.1016/0022-0000(80)90057-4openalex-snapshot

The subgraph homeomorphism problem

inferred← citeshttps://doi.org/10.1016/0022-2496(70)90062-3openalex-snapshot

Intransitive indifference with unequal indifference intervals

inferred← citeshttps://doi.org/10.1016/0022-2496(71)90007-1openalex-snapshot

Conditions for the representation of absolute judgment and pair comparison isosensitivity curves by cumulative distributions

inferred← citeshttps://doi.org/10.1016/0022-2496(81)90059-6openalex-snapshot

Difference measurement spaces

inferred← citeshttps://doi.org/10.1016/0022-2496(85)90011-2openalex-snapshot

Applications of the theory of meaningfulness to psychology

inferred← citeshttps://doi.org/10.1016/0022-2496(92)90035-6openalex-snapshot

Norbert Wiener on the theory of measurement 1914 1915 1921

inferred← citeshttps://doi.org/10.1016/0022-4049(71)90016-8openalex-snapshot

Betweenness, orders and interval graphs

inferred← citeshttps://doi.org/10.1016/0022-5193(83)90112-1openalex-snapshot

The combinatorial distance geometry method for the calculation of molecular conformation. I. A new approach to an old problem

inferred← citeshttps://doi.org/10.1016/0095-8956(71)90055-4openalex-snapshot

A note on the eigenvalues of a graph

inferred← citeshttps://doi.org/10.1016/0095-8956(72)90019-6openalex-snapshot

A structure theorem for the consecutive 1's property

inferred← citeshttps://doi.org/10.1016/0095-8956(72)90030-5openalex-snapshot

On edge but not vertex transitive regular graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(72)90046-9openalex-snapshot

Isographs and oriented isographs

inferred← citeshttps://doi.org/10.1016/0095-8956(73)90026-9openalex-snapshot

A smooth and unified proof of cases 6, 5 and 3 of the ringel-youngs theorem

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(74)90066-5openalex-snapshot

The reconstruction of outerplanar graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot

The intersection graphs of subtrees in trees are exactly the chordal graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(76)90050-2openalex-snapshot

Extremal graphs of diameter 4

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(80)90086-6openalex-snapshot

The group and the minimal polynomial of a graph

inferred← citeshttps://doi.org/10.1016/0095-8956(83)90057-6openalex-snapshot

On the sphericity and cubicity of graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(90)90120-oopenalex-snapshot

Graph minors. IV. Tree-width and well-quasi-ordering

inferred← citeshttps://doi.org/10.1016/0097-3165(93)90021-yopenalex-snapshot

A coding algorithm for Rényi trees

inferred← citeshttps://doi.org/10.1016/0165-4896(94)00777-6openalex-snapshot

On properties of unit interval graphs with a perceptual motivation

inferred← citeshttps://doi.org/10.1016/0165-4896(96)88694-xopenalex-snapshot

On properties of unit interval graphs with a perceptual motivation

inferred← citeshttps://doi.org/10.1016/0166-218x(84)90016-7openalex-snapshot

Tolerance graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(84)90113-6openalex-snapshot

Space graphs and sphericity

inferred← citeshttps://doi.org/10.1016/0166-218x(85)90061-7openalex-snapshot

Applications of edge coverings by cliques

inferred← citeshttps://doi.org/10.1016/0166-218x(92)90126-uopenalex-snapshot

Graphs with small diameter after edge deletion

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90231-copenalex-snapshot

ø-threshold and ø-tolerance chain graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90244-iopenalex-snapshot

Coloring drawings of bipartite graphs: A problem in automated assembly

inferred← citeshttps://doi.org/10.1016/0166-218x(94)00044-eopenalex-snapshot

Proper and unit tolerance graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(94)00131-vopenalex-snapshot

Large survivable nets and the generalized prisms

inferred← citeshttps://doi.org/10.1016/0166-218x(94)90081-7openalex-snapshot

Intersection graphs of concatenable subtrees of graphs

inferred← citeshttps://doi.org/10.1016/0167-6377(81)90018-3openalex-snapshot

An application of vertex packing to data analysis in the evaluation of pavement deterioration

inferred← citeshttps://doi.org/10.1016/0196-6774(83)90021-4openalex-snapshot

The random selection of unlabeled graphs

inferred← citeshttps://doi.org/10.1016/0270-0255(87)90063-7openalex-snapshot

Modelling inexact utility theory in a multi-valued logic of approximation

inferred← citeshttps://doi.org/10.1016/0378-8733(83)90022-9openalex-snapshot

Spheres, cubes and boxes: Graph dimensionality and network structure

inferred← citeshttps://doi.org/10.1016/0378-8733(85)90017-6openalex-snapshot

Toward a theory of disintegration in communication networks

inferred← citeshttps://doi.org/10.1016/b0-08-043076-7/00587-8openalex-snapshot

Axiomatic Theories

inferred← citeshttps://doi.org/10.1016/b978-0-08-097086-8.43012-6openalex-snapshot

Axiomatic Theories

showing the first 200 of 378 · page through all 378

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.