On the public citation graph
The Theory of Graphs and its Applications.
0 signed · 69 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22763openalex-snapshot
Bounding the tripartite‐circle crossing number of complete tripartite graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-2155-8_30openalex-snapshot
Performance Improvement of an Optical Network Providing Services Based on Multicast
inferred← citeshttps://doi.org/10.1007/978-1-4613-4606-7_49openalex-snapshot
An Interactive Graph Theory System
inferred← citeshttps://doi.org/10.1007/978-94-009-2017-0_9openalex-snapshot
Reconstructing 3D Objects from Cross-Sections
inferred← citeshttps://doi.org/10.1007/bf01644072openalex-snapshot
On the graph for which there is a tree as the inverse interchange graph of a local graph
inferred← citeshttps://doi.org/10.1007/bf01917659openalex-snapshot
Ein verallgemeinertes deterministisches Netzplanmodell
inferred← citeshttps://doi.org/10.1007/bf02243881openalex-snapshot
An algorithm for hierarchical reduction and decomposition of a directed graph
inferred← citeshttps://doi.org/10.1007/bf02277215openalex-snapshot
Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen
inferred← citeshttps://doi.org/10.1007/bf02389716openalex-snapshot
A cluster analysis based on graph theory
inferred← citeshttps://doi.org/10.1007/s00373-019-02077-4openalex-snapshot
On the Crossing Number of 2-Page Book Drawings of $$K_{n}$$ with Prescribed Number of Edges in Each Page
inferred← citeshttps://doi.org/10.1016/0001-8708(72)90021-7openalex-snapshot
On the complexity of the marriage problem
inferred← citeshttps://doi.org/10.1016/0004-3702(72)90050-1openalex-snapshot
Strategy construction using homomorphisms between games
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90092-8openalex-snapshot
On the maximal order of cyclicity of antisymmetric directed graphs
inferred← citeshttps://doi.org/10.1016/0016-0032(67)90046-4openalex-snapshot
Optimum flows in general communication networks
inferred← citeshttps://doi.org/10.1016/0020-0190(73)90030-6openalex-snapshot
Some properties of fully reducible graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(77)90068-0openalex-snapshot
Testing for equality between maximum matching and minimum node covering
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90057-4openalex-snapshot
The subgraph homeomorphism problem
inferred← citeshttps://doi.org/10.1016/0022-2496(65)90003-9openalex-snapshot
The relation between the discard and regularity conditions for choice probabilities
inferred← citeshttps://doi.org/10.1016/0041-1647(68)90016-6openalex-snapshot
Scheduling of traffic lights—A new approach
inferred← citeshttps://doi.org/10.1016/0045-7906(79)90002-8openalex-snapshot
Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
inferred← citeshttps://doi.org/10.1016/0360-8352(81)90004-8openalex-snapshot
Computerized facility layout with graph theory
inferred← citeshttps://doi.org/10.1016/0550-3213(80)90055-3openalex-snapshot
Comments on the computation of quantum fluctuations of gluons in a multi-instanton background
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.02.005openalex-snapshot
Optimal configuration of an optical network providing predefined multicast transmissions
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.042openalex-snapshot
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.009openalex-snapshot
Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph
inferred← citeshttps://doi.org/10.1016/j.jics.2023.100968openalex-snapshot
Graph theoretical procedures for determination of eigenspectra of molecular graphs: A brief review
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.010openalex-snapshot
Theoretical aspects of equitable partition of networks into sparse modules
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90403-4openalex-snapshot
Loop-free compositions of certain finite automata. II
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10158-1openalex-snapshot
A conjeccture concerning strongly connected graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00184-9openalex-snapshot
Districting for salt spreading operations
inferred← citeshttps://doi.org/10.1017/s0004972700019511openalex-snapshot
Graphs without cycles of even length
inferred← citeshttps://doi.org/10.1017/s0004972700042660openalex-snapshot
Polyhedral decompositions of cubic graphs
inferred← citeshttps://doi.org/10.1017/s0305004100041657openalex-snapshot
A criterion for the planarity of the total graph of a graph
inferred← citeshttps://doi.org/10.1080/00029890.1987.12000694openalex-snapshot
Trees and Euler Tours in a Planar Graph and Its Relatives
inferred← citeshttps://doi.org/10.1080/00207168308803350openalex-snapshot
Complexity and performance of a graph theory algorithm for cluster analysis
inferred← citeshttps://doi.org/10.1088/1742-6596/1306/1/012006openalex-snapshot
Super (a, d)-H-antimagic total labeling of edge corona product on cycle with path graph and cycle with cycle graph
inferred← citeshttps://doi.org/10.1088/1742-6596/1664/1/012026openalex-snapshot
Additional Properties of Frame Domination in Graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/855/1/012037openalex-snapshot
Super (a, d)-Cycle-Antimagic Total Labeling on Triangular Ladder Graph and Generalized Jahangir Graph
inferred← citeshttps://doi.org/10.1090/s0002-9947-1973-0321780-8openalex-snapshot
Upper Bounds for Vertex Degrees of Planar 5-Chromatic Graphs
inferred← citeshttps://doi.org/10.1108/eb005447openalex-snapshot
SOCIAL CHOICE AND SELF‐ORGANIZATION UNDER FUZZY MANAGEMENT
inferred← citeshttps://doi.org/10.1109/18.312161openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferred← citeshttps://doi.org/10.1109/icks.2004.1313429openalex-snapshot
Recent metaheuristic algorithms for the generalized assignment problem
inferred← citeshttps://doi.org/10.1109/sibgrapi.2009.43openalex-snapshot
Analysis of the Watershed Algorithms Based on the Breadth-First and Depth-First Exploring Methods
inferred← citeshttps://doi.org/10.1109/t-c.1973.223683openalex-snapshot
On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
inferred← citeshttps://doi.org/10.1109/tac.1974.1100611openalex-snapshot
On come computational aspects of the factorization algorithm of an elementary paraconjugate Hermitian polynomial matrix
inferred← citeshttps://doi.org/10.1109/tc.1982.1676084openalex-snapshot
Some New Results About the (d, k) Graph Problem
inferred← citeshttps://doi.org/10.1109/tpas.1970.292682openalex-snapshot
Sparsity-Directed Decomposition for Gaussian Elimination on Matrices
inferred← citeshttps://doi.org/10.1112/jlms.12179openalex-snapshot
Packing trees of unbounded degrees in random graphs
inferred← citeshttps://doi.org/10.1137/0406027openalex-snapshot
Counting Embeddings of Planar Graphs Using DFS Trees
inferred← citeshttps://doi.org/10.1137/0706039openalex-snapshot
Jacobi and Gauss–Seidel Methods for Nonlinear Network Problems
inferred← citeshttps://doi.org/10.1145/2261250.2261310openalex-snapshot
The 2-page crossing number of K n
inferred← citeshttps://doi.org/10.1145/321679.321683openalex-snapshot
Analysis of Graphs by Ordering of Nodes
inferred← citeshttps://doi.org/10.1145/362814.362819openalex-snapshot
An efficient search algorithm to find the elementary circuits of a graph
inferred← citeshttps://doi.org/10.1145/800133.804330openalex-snapshot
The subgraph homeomorphism problem
inferred← citeshttps://doi.org/10.1147/rd.191.0002openalex-snapshot
Approximating Complex Surfaces by Triangulation of Contour Lines
inferred← citeshttps://doi.org/10.11558/jjesp1960.8.57openalex-snapshot
A review on the graph-theoretical studies in recent years
inferred← citeshttps://doi.org/10.1561/9781601981851openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferred← citeshttps://doi.org/10.19086/aic.2023.3openalex-snapshot
Towards a Hypergraph version of the Pósa–Seymour Conjecture
inferred← citeshttps://doi.org/10.21136/cmj.1986.102073openalex-snapshot
Tournaments with the same neighbourhoods
inferred← citeshttps://doi.org/10.2478/ausi-2014-0022openalex-snapshot
On vertex independence number of uniform hypergraphs
inferred← citeshttps://doi.org/10.3233/jid-2004-8206openalex-snapshot
A NOVEL HIERARCHICAL METHOD FOR DECOMPOSITION AND DESIGN OF WORKFLOW MODELS
inferred← citeshttps://doi.org/10.46298/dmtcs.8719openalex-snapshot
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
inferred← citeshttps://doi.org/10.54660/anfo.2022.3.6.25openalex-snapshot
Minimal equitable dominating graph
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.