On the public citation graph
On covering the points of a graph with point disjoint paths
0 signed · 56 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/bfb0066448openalex-snapshot
On the hamiltonian completion problem
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50009-xopenalex-snapshot
EVOLUTION OF THE PATH NUMBER OF A GRAPH: COVERING AND PACKING IN GRAPHS, II††This research was supported in part by a grant to the Research Center for Group Dynamics of the University of Michigan from the NIH Biomedical Sciences Division.
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45132.xopenalex-snapshot
COVERING AND PACKING IN GRAPHS, I.
inferredcites →https://doi.org/10.1145/362007.362015openalex-snapshot
A formal system for information retrieval from files
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
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.3190060308openalex-snapshot
Atoll decompositions of graphs
inferred← citeshttps://doi.org/10.1002/net.22290openalex-snapshot
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
inferred← citeshttps://doi.org/10.1002/net.3230110108openalex-snapshot
Covering and packing in graphs IV: Linear arboricity
inferred← citeshttps://doi.org/10.1002/net.3230200106openalex-snapshot
Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weight
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_14openalex-snapshot
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_13openalex-snapshot
Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-540-72606-7_61openalex-snapshot
Optimal Topology Design for Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-34062-8_36openalex-snapshot
Span of T-Colorings Multigraphs
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_5openalex-snapshot
Sum-of-Max Chain Partition of a Tree
inferred← citeshttps://doi.org/10.1007/bf01086177openalex-snapshot
Graph theory (algorithmic, algebraic, and metric problems)
inferred← citeshttps://doi.org/10.1007/bf01408172openalex-snapshot
On mapping processes to processors in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0006618openalex-snapshot
A necessary condition for the elimination of crane interference
inferred← citeshttps://doi.org/10.1007/bfb0066448openalex-snapshot
On the hamiltonian completion problem
inferred← citeshttps://doi.org/10.1007/s00453-023-01132-0openalex-snapshot
On Finding the Best and Worst Orientations for the Metric Dimension
inferred← citeshttps://doi.org/10.1007/s10231-007-0044-3openalex-snapshot
On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
inferred← citeshttps://doi.org/10.1007/s10951-010-0193-xopenalex-snapshot
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
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(79)90153-5openalex-snapshot
Path coverings of the vertices of a tree
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(93)e0098-oopenalex-snapshot
Relating path coverings to vertex labellings with a condition at distance two
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90080-6openalex-snapshot
A linear algorithm for the hamiltonian completion number of a tree
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90103-xopenalex-snapshot
A linear algorithm for the number of degree constrained subforests of a tree
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90064-5openalex-snapshot
Linear algorithm for optimal path cover problem on interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00163-8openalex-snapshot
The total interval number of a tree and the Hamiltonian completion number of its line graph
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00142-zopenalex-snapshot
Path covering problems and testing of printed circuits
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90159-yopenalex-snapshot
Optimal covering of cacti by vertex-disjoint paths
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.11.018openalex-snapshot
On graph-based characteristics of optimal overlay topologies
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.001openalex-snapshot
Hamiltonian completions of sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.08.005openalex-snapshot
On island sequences of labelings with a condition at distance two
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.020openalex-snapshot
Path covering number and L(2,1) -labeling number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.05.016openalex-snapshot
Complexity and computation of connected zero forcing
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.043openalex-snapshot
The approximability of the weighted Hamiltonian path completion problem on a tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.023openalex-snapshot
On the k-path cover problem for cacti
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00287-3openalex-snapshot
Differential approximation results for the traveling salesman and related problems
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10081-6openalex-snapshot
Jump number maximization for proper interval graphs and series—parallel graphs
inferred← citeshttps://doi.org/10.1017/s1446181100013894openalex-snapshot
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
inferred← citeshttps://doi.org/10.1080/00207543.2016.1206672openalex-snapshot
Two-machine flow shop problem with unit-time operations and conflict graph
inferred← citeshttps://doi.org/10.1080/03052158708902546openalex-snapshot
THE HAMILTONIAN COMPLETION PROBLEM AND ITS SOLUTION
inferred← citeshttps://doi.org/10.1145/321892.321897openalex-snapshot
Advances on the Hamiltonian Completion Problem
inferred← citeshttps://doi.org/10.1145/322003.322005openalex-snapshot
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
inferred← citeshttps://doi.org/10.1155/s0161171283000617openalex-snapshot
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-08112019-153707openalex-snapshot
Covering graphs by nontrivial paths
inferred← citeshttps://doi.org/10.2478/ausi-2023-0003openalex-snapshot
Connected certified domination edge critical and stable graphs
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.