On the public citation graph
Theory and Applications of Graphs
0 signed · 391 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.3190010111openalex-snapshot
A canonical representation of trivalent hamiltonian graphs
inferredcites →https://doi.org/10.1002/net.3230030303openalex-snapshot
On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bfb0060126openalex-snapshot
Characterizations of 2-dimensional trees
inferredcites →https://doi.org/10.1007/bfb0070370openalex-snapshot
On graphs having prescribed clique number, chromatic number, and maximum degree
inferredcites →https://doi.org/10.1007/bfb0070377openalex-snapshot
Imbeddings of metacyclic cayley graphs
inferredcites →https://doi.org/10.1007/bfb0070390openalex-snapshot
Planar and outerplanar cayley graphs of free groups
inferredcites →https://doi.org/10.1007/bfb0070395openalex-snapshot
Matchings in graphs III: Infinite graphs
inferredcites →https://doi.org/10.1007/bfb0070398openalex-snapshot
The minimum degree and connectivity of a graph
inferredcites →https://doi.org/10.1007/bfb0070405openalex-snapshot
Hamiltonian persistency is periodic among iterated line digraphs
inferredcites →https://doi.org/10.1007/bfb0070411openalex-snapshot
Order preserving embeddings of aographs
inferredcites →https://doi.org/10.1007/bfb0070412openalex-snapshot
Circular arc graphs: New uses and a new algorithm
inferredcites →https://doi.org/10.1007/bfb0070414openalex-snapshot
Infinite cayley graphs of connectivity one
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90027-6openalex-snapshot
Generalizations of magic graphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90058-6openalex-snapshot
The strongest monotone degree condition for n-connectedness of a graph
inferredcites →https://doi.org/10.1016/0095-8956(78)90078-3openalex-snapshot
Distances in orientations of graphs
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.1016/s0021-9800(70)80019-9openalex-snapshot
Characterizations of derived graphs
inferredcites →https://doi.org/10.1016/s0095-8956(78)80013-6openalex-snapshot
Characterizations of regular magic graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70511-9openalex-snapshot
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
inferredcites →https://doi.org/10.1021/ja00856a001openalex-snapshot
Characterization of molecular branching
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08715-7openalex-snapshot
On the structure of linear graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11072-7openalex-snapshot
Convergence of sequences of convex sets, cones and functions
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1090/s0002-9947-1966-0196599-8openalex-snapshot
Convergence of Sequences of Convex Sets, Cones and Functions. II
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0231740-1openalex-snapshot
On Hamiltonian Line-Graphs
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
inferredcites →https://doi.org/10.1142/9789812569462_0003openalex-snapshot
Chromatic Equivalence of Graphs
inferredcites →https://doi.org/10.1215/s0012-7094-73-04054-4openalex-snapshot
Linear homogeneous Diophantine equations and magic labelings of graphs
inferredcites →https://doi.org/10.1215/s0012-7094-76-04342-8openalex-snapshot
Magic labelings of graphs, symmetric magic squares, systems of parameters, and Cohen-Macaulay rings
inferredcites →https://doi.org/10.4153/cjm-1965-072-1openalex-snapshot
A Theorem on k-Saturated Graphs
inferredcites →https://doi.org/10.4153/cmb-1965-051-3openalex-snapshot
On Eulerian and Hamiltonian Graphs and Line Graphs
inferredcites →https://doi.org/10.4153/cmb-1972-081-0openalex-snapshot
A Cure for the Telephone Disease
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.10086openalex-snapshot
Size ramsey numbers of stars versus 4‐chromatic graphs
inferred← citeshttps://doi.org/10.1002/jgt.20417openalex-snapshot
Finite fields and the 1‐chromatic number of orientable surfaces
inferred← citeshttps://doi.org/10.1002/jgt.20631openalex-snapshot
Excluding Induced Subdivisions of the Bull and Related Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21730openalex-snapshot
The Erdös–Hajnal Conjecture—A Survey
inferred← citeshttps://doi.org/10.1002/jgt.22752openalex-snapshot
A forbidden pair for connected graphs to have spanning k‐trees
inferred← citeshttps://doi.org/10.1002/jgt.22829openalex-snapshot
Polynomial bounds for chromatic number II: Excluding a star‐forest
inferred← citeshttps://doi.org/10.1002/jgt.22862openalex-snapshot
Polynomial bounds for chromatic number. III. Excluding a double star
inferred← citeshttps://doi.org/10.1002/jgt.23061openalex-snapshot
Heroes in oriented complete multipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.23129openalex-snapshot
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
inferred← citeshttps://doi.org/10.1002/jgt.3190140305openalex-snapshot
Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190160209openalex-snapshot
Supereulerian graphs: A survey
inferred← citeshttps://doi.org/10.1002/jgt.3190200406openalex-snapshot
Hamiltonicity for K1, r‐free graphs
inferred← citeshttps://doi.org/10.1006/jctb.1997.1792openalex-snapshot
An Infinite Series of Surfaces with Known 1-Chromatic Number
inferred← citeshttps://doi.org/10.1006/jctb.1997.1811openalex-snapshot
Chromatic Coefficients of Linear Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1894openalex-snapshot
Induced Cycles and Chromatic Number
inferred← citeshttps://doi.org/10.1006/jctb.2000.1988openalex-snapshot
Contraction–Deletion Invariants for Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.2022openalex-snapshot
Long Cycles through a Linear Forest
inferred← citeshttps://doi.org/10.1007/11682462_62openalex-snapshot
Packing Dicycle Covers in Planar Graphs with No K 5–e Minor
inferred← citeshttps://doi.org/10.1007/11753728_58openalex-snapshot
Capturing an Intruder in the Pyramid
inferred← citeshttps://doi.org/10.1007/3-540-44629-x_18openalex-snapshot
Graph Colouring by Maximal Evidence Edge Adding
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_37openalex-snapshot
Computing Optimal Linear Layouts of Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_32openalex-snapshot
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
inferred← citeshttps://doi.org/10.1007/978-0-8176-8355-9_18openalex-snapshot
A Nonzero-Sum Search Game with Two Competitive Searchers and a Target
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_57openalex-snapshot
Dual Integrality in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_76openalex-snapshot
Graph Searching and Related Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
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_9openalex-snapshot
Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_2openalex-snapshot
Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_3openalex-snapshot
The Impact of the Chain Decomposition Theorem on Classical Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-0348-0859-0_12openalex-snapshot
Some Results on Chromaticity of Quasilinear Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_35openalex-snapshot
On Minimum Circular Arrangement
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_4openalex-snapshot
Computing Small Search Numbers in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_15openalex-snapshot
On the Fast Searching Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_20openalex-snapshot
Searching Trees with Sources and Targets
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_22openalex-snapshot
Mixed Search Number of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_12openalex-snapshot
Directed Searching Digraphs: Monotonicity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_4openalex-snapshot
Digraph Strong Searching: Monotonicity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_22openalex-snapshot
Intruder Capture in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_37openalex-snapshot
Arc Searching Digraphs Without Jumping
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_30openalex-snapshot
The Cost of Monotonicity in Distributed Graph Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_31openalex-snapshot
Tree Decontamination with Temporary Immunity
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_20openalex-snapshot
Pathwidth is NP-Hard for Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_5openalex-snapshot
Edge Search Number of Cographs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-16958-8_9openalex-snapshot
Toward Simulating Realistic Pursuit-Evasion Using a Roadmap-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-25090-3_29openalex-snapshot
Roadmap-Based Level Clearing of Buildings
inferred← citeshttps://doi.org/10.1007/978-3-642-28572-1_63openalex-snapshot
Towards Experimental Analysis of Challenge Scenarios in Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_22openalex-snapshot
SAT and IP Based Algorithms for Magic Labeling with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_2openalex-snapshot
Problems in Graph Theory from Memphis
inferred← citeshttps://doi.org/10.1007/978-3-642-72087-1_4openalex-snapshot
The Application of Random Coincidence Graphs for Testing the Homogeneity of Data
inferred← citeshttps://doi.org/10.1007/978-3-642-79999-0_16openalex-snapshot
Graph-Theoretic Models for Testing the Homogeneity of Data
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_35openalex-snapshot
Locally-maximal embeddings of graphs in orientable surfaces
inferred← citeshttps://doi.org/10.1007/978-90-481-9707-1_14openalex-snapshot
Cooperative Mission and Path Planning for a Team of UAVs
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf00551119openalex-snapshot
Spectral analysis of graphs by cyclic automorphism subgroups
inferred← citeshttps://doi.org/10.1007/bf02579299openalex-snapshot
Bounds on the convex label number of trees
inferred← citeshttps://doi.org/10.1007/bfb0036931openalex-snapshot
Minimizing width in linear layouts
inferred← citeshttps://doi.org/10.1007/bfb0045095openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1007/bfb0071525openalex-snapshot
Composite graphs with edge stability index one
inferred← citeshttps://doi.org/10.1007/bfb0071618openalex-snapshot
Random graphs and the physical world
inferred← citeshttps://doi.org/10.1007/bfb0071639openalex-snapshot
Domatic number and bichromaticity of a graph
inferred← citeshttps://doi.org/10.1007/bfb0073113openalex-snapshot
Random subgraphs of regular graphs
inferred← citeshttps://doi.org/10.1007/bfb0073116openalex-snapshot
Equalities involving certain graphical distributions
inferred← citeshttps://doi.org/10.1007/bfb0092276openalex-snapshot
On domination related concepts in Graph Theory
inferred← citeshttps://doi.org/10.1007/s00224-008-9116-zopenalex-snapshot
Contiguous Search Problem in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0831-7openalex-snapshot
On the Chromaticity of Multi-Bridge Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1232-5openalex-snapshot
On the Chromaticity of Quasi Linear Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1307-yopenalex-snapshot
A Degree Sequence Variant of Graph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-024-02754-zopenalex-snapshot
A Note on the Gyárfás–Sumner Conjecture
inferred← citeshttps://doi.org/10.1007/s00453-011-9524-3openalex-snapshot
A Distributed Algorithm for Computing the Node Search Number in Trees
inferred← citeshttps://doi.org/10.1007/s10114-020-9378-1openalex-snapshot
Properties of π-skew Graphs with Applications
inferred← citeshttps://doi.org/10.1007/s10255-019-0815-9openalex-snapshot
On Traceability of Claw-o−1-heavy Graphs
inferred← citeshttps://doi.org/10.1007/s10458-011-9180-7openalex-snapshot
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
inferred← citeshttps://doi.org/10.1007/s10472-013-9383-5openalex-snapshot
Cooperative exploration and protection of a workspace assisted by information networks
inferred← citeshttps://doi.org/10.1007/s10514-010-9189-9openalex-snapshot
GSST: anytime guaranteed search
inferred← citeshttps://doi.org/10.1007/s10514-011-9241-4openalex-snapshot
Search and pursuit-evasion in mobile robotics
inferred← citeshttps://doi.org/10.1007/s10514-011-9255-yopenalex-snapshot
Algorithms and complexity results for graph-based pursuit evasion
inferred← citeshttps://doi.org/10.1007/s10514-011-9260-1openalex-snapshot
Distributed pursuit-evasion without mapping or global localization via local frontiers
inferred← citeshttps://doi.org/10.1007/s10514-015-9491-7openalex-snapshot
Multi-robot target detection and tracking: taxonomy and survey
inferred← citeshttps://doi.org/10.1007/s10732-011-9180-4openalex-snapshot
Metaheuristics for robust graph coloring
inferred← citeshttps://doi.org/10.1007/s10844-009-0092-9openalex-snapshot
Design of a multi_agent system for worm spreading_reduction
inferred← citeshttps://doi.org/10.1007/s10878-007-9042-zopenalex-snapshot
Monotonicity of strong searching on digraphs
inferred← citeshttps://doi.org/10.1007/s10878-023-01088-5openalex-snapshot
On the chromatic number of $$P_5$$-free graphs with no large intersecting cliques
inferred← citeshttps://doi.org/10.1007/s11425-013-4631-zopenalex-snapshot
Every 3-connected {K 1,3,N 3,3,3}-free graph is Hamiltonian
inferred← citeshttps://doi.org/10.1007/s11464-016-0613-0openalex-snapshot
Chromatic number and subtrees of graphs
inferred← citeshttps://doi.org/10.1007/s11786-014-0213-xopenalex-snapshot
Antimagicness of Generalized Corona and Snowflake Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90217-xopenalex-snapshot
Complements of Steinhaus graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90228-4openalex-snapshot
The Helly-type property of non-trivial intervals on a tree
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90160-7openalex-snapshot
Vertex-to-vertex pursuit in a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90061-xopenalex-snapshot
Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90072-4openalex-snapshot
The chromaticity of wheels
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90151-1openalex-snapshot
Graphs uniquely hamiltonian-connected from a vertex
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90064-6openalex-snapshot
Bipartite Steinhaus graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90200-2openalex-snapshot
Small order graph-tree Ramsey numbers
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90210-0openalex-snapshot
On constructive methods in the theory of colour-critical graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90319-1openalex-snapshot
On the size of graphs of a given bandwidth
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90325-7openalex-snapshot
The minimum size of graphs hamiltonian-connected from a vertex
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90163-copenalex-snapshot
Extending cycles in graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90326-dopenalex-snapshot
The chromaticity of wheels with a missing spoke
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90351-hopenalex-snapshot
Domatically critical and domatically full graphs
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(91)90057-9openalex-snapshot
On the structure of graphs uniquely hamiltonian-connected from a vertex
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90126-mopenalex-snapshot
A necessary and sufficient condition for a graph G with diameter 5 to be 2-diameter-stable
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90258-4openalex-snapshot
T-colorings of graphs: recent results and open problems
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90468-hopenalex-snapshot
Hamiltonian properties of graphs with large neighborhood unions
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90600-kopenalex-snapshot
Colorful induced subgraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90346-uopenalex-snapshot
Chromaticity of a family of K4-homeomorphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0211-lopenalex-snapshot
Generating strings for bipartite Steinhaus graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90092-2openalex-snapshot
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00244-qopenalex-snapshot
Cycle packings in graphs and digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00379-bopenalex-snapshot
Large sets of pseudosimilar vertices
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90018-dopenalex-snapshot
Single step graph search problem
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90430-vopenalex-snapshot
The structure matrix of the class of r-multigraphs with a prescribed degree sequence
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00154-6openalex-snapshot
Loop and cyclic niche graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(94)90486-3openalex-snapshot
Laplacian matrices of graphs: a survey
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90050-3openalex-snapshot
The interval number of a planar graph: Three intervals suffice
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90078-3openalex-snapshot
A combinatorial analog of the Jordan Curve Theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90034-0openalex-snapshot
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90045-6openalex-snapshot
Geodetic graphs of diameter two and some related structures
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90068-2openalex-snapshot
Counterexamples to Adám's conjecture on arc reversals in directed graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90115-gopenalex-snapshot
Embeddings of graphs with no short noncontractible cycles
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90122-gopenalex-snapshot
A generalization of an inequality of Stepanov
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90069-vopenalex-snapshot
On multipartite tournaments
inferred← citeshttps://doi.org/10.1016/0097-3165(79)90011-6openalex-snapshot
Order 24 Hadamard matrices of character at least 3
inferred← citeshttps://doi.org/10.1016/0097-3165(81)90054-6openalex-snapshot
Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90077-xopenalex-snapshot
Computing the boxicity of a graph by covering its complement by cointerval graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90085-9openalex-snapshot
A characterization of competition graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90087-2openalex-snapshot
A characterization of competition graphs of arbitrary digraphs
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(86)90002-8openalex-snapshot
On an extremal problem concerning the interval number of a graph
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90041-2openalex-snapshot
Multiterminal duality and three-terminal series-parallelness
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90007-yopenalex-snapshot
The double competition number of some triangle-free graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90026-9openalex-snapshot
Asymptotic number of symmetries in locally restricted trees
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90004-topenalex-snapshot
Optimal multiple interval assignments in frequency assignment and traffic phasing
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00164-9openalex-snapshot
The expected number of symmetries in locally restricted trees II
inferred← citeshttps://doi.org/10.1016/0166-8641(95)00028-fopenalex-snapshot
The symmetric genus of metacyclic groups
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90038-xopenalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90041-6openalex-snapshot
An algorithmic characterization of total digraphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80012-3openalex-snapshot
The complexity of pursuit on a graph
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
inferred← citeshttps://doi.org/10.1016/j.aim.2011.01.004openalex-snapshot
Sparse partition universal graphs for graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.akcej.2017.03.001openalex-snapshot
Edge odd graceful labeling of some path and cycle related graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2008.04.051openalex-snapshot
Minimum linear arrangement of Chord graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128205openalex-snapshot
Ramsey-type results for path covers and path partitions. II. digraphs
inferred← citeshttps://doi.org/10.1016/j.aml.2010.12.009openalex-snapshot
The m -step competition graphs of doubly partial orders
inferred← citeshttps://doi.org/10.1016/j.aml.2011.01.013openalex-snapshot
Bounds on the k -domination number of a graph
inferred← citeshttps://doi.org/10.1016/j.aml.2011.03.003openalex-snapshot
Graphs having many holes but with small competition numbers
inferred← citeshttps://doi.org/10.1016/j.aml.2011.04.012openalex-snapshot
The competition numbers of ternary Hamming graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2011.10.003openalex-snapshot
The competition number of a graph and the dimension of its hole space
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110387openalex-snapshot
Variable neighborhood search for weighted total domination problem and its application in social network information spreading
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.11.017openalex-snapshot
Continuous graph partitioning for camera network surveillance
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101961openalex-snapshot
Lions and contamination: Monotone clearings
inferred← citeshttps://doi.org/10.1016/j.comnet.2021.107919openalex-snapshot
Resource allocation for offloading-efficiency maximization in clustered NOMA-enabled mobile edge computing networks
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.005openalex-snapshot
A class of acyclic digraphs with interval competition graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.11.009openalex-snapshot
The elimination procedure for the competition number is not optimal
inferred← citeshttps://doi.org/10.1016/j.dam.2006.09.013openalex-snapshot
On CCE graphs of doubly partial orders
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.007openalex-snapshot
Connected graph searching in chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.004openalex-snapshot
The competition number of a graph with exactly h holes, all of which are independent
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.010openalex-snapshot
Note on the m-step competition numbers of paths and cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.003openalex-snapshot
Series–parallel chromatic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.007openalex-snapshot
An upper bound for the competition numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.001openalex-snapshot
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.002openalex-snapshot
First-Fit coloring of bounded tolerance graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.008openalex-snapshot
The (1,2) -step competition graph of a tournament
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.020openalex-snapshot
Edge search number of cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.017openalex-snapshot
The competition numbers of complete multipartite graphs with many partite sets
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.018openalex-snapshot
A survey of Nordhaus–Gaddum type relations
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.005openalex-snapshot
Competition numbers of complete r -partite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.030openalex-snapshot
Super restricted edge-connectivity of graphs with diameter 2
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.004openalex-snapshot
Three-fast-searchable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.013openalex-snapshot
The (1,2) -step competition graph of a pure local tournament that is not round decomposable
inferred← citeshttps://doi.org/10.1016/j.dam.2018.02.017openalex-snapshot
Gallai’s question and constructions of almost hypotraceable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.12.014openalex-snapshot
Using semidirect products of groups to build classes of interconnection networks
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.2021.04.021openalex-snapshot
On indicated coloring of lexicographic product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.024openalex-snapshot
Achromatic number and facial achromatic number of connected locally-connected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.011openalex-snapshot
Four-searchable biconnected outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.028openalex-snapshot
The phylogeny number of a graph in the aspect of its triangles and diamonds
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.024openalex-snapshot
An introduction to the deduction number
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.2004.02.015openalex-snapshot
Sunflower hypergraphs are chromatically unique
inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.016openalex-snapshot
The competition number of a graph having exactly one hole
inferred← citeshttps://doi.org/10.1016/j.disc.2008.10.016openalex-snapshot
On detour homogeneous digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.016openalex-snapshot
Regular Steinhaus graphs of odd degree
inferred← citeshttps://doi.org/10.1016/j.disc.2010.01.020openalex-snapshot
Boxicity and cubicity of asteroidal triple free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.02.013openalex-snapshot
Extremal cliques in Steinhaus graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.04.026openalex-snapshot
4-connected triangulations and 4-orderedness
showing the first 200 of 341 · page through all 341
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.