On the public citation graph
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
0 signed · 66 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/bf00337618openalex-snapshot
Computing the bump number with techniques from two-processor scheduling
inferredcites →https://doi.org/10.1007/bfb0028791openalex-snapshot
On the restriction of some NP-complete graph problems to permutation graphs
inferredcites →https://doi.org/10.1007/bfb0060123openalex-snapshot
Hamiltonian circuits in graphs and digraphs
inferredcites →https://doi.org/10.1016/0012-365x(86)90147-0openalex-snapshot
A combinatorial bijection between linear extensions of equivalent orders
inferredcites →https://doi.org/10.1016/0020-0190(85)90050-xopenalex-snapshot
Finding Hamiltonian circuits in interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(86)90135-3openalex-snapshot
Hamiltonian circuits in interval graph generalizations
inferredcites →https://doi.org/10.1016/0020-0190(89)90059-8openalex-snapshot
The Hamiltonian circuit problem for circle graphs is NP-complete
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90168-aopenalex-snapshot
Hamiltonian cycle is polynomial on cocomparability graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
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(199805)28:1<31::aid-jgt3>3.0.co;2-gopenalex-snapshot
Powers of Hamiltonian paths in interval graphs
inferred← citeshttps://doi.org/10.1002/jgt.23108openalex-snapshot
On λ $\lambda $‐backbone coloring of cliques with tree backbones in linear time
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_22openalex-snapshot
Radio Labeling with Pre-assigned Frequencies
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_14openalex-snapshot
Parameterizing Path Partitions
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_14openalex-snapshot
On the Structure of Hamiltonian Graphs with Small Independence Number
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_7openalex-snapshot
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_35openalex-snapshot
The Longest Path Problem Is Polynomial on Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_5openalex-snapshot
The Longest Path Problem is Polynomial on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_9openalex-snapshot
The Longest Path Problem on Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/bfb0015415openalex-snapshot
Weighted domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9411-3openalex-snapshot
The Longest Path Problem has a Polynomial Solution on Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9583-5openalex-snapshot
The Longest Path Problem Is Polynomial on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/s11227-017-1984-zopenalex-snapshot
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole
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/0012-365x(95)00359-5openalex-snapshot
1-Tough cocomparability graphs are hamiltonian
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90168-aopenalex-snapshot
Hamiltonian cycle is polynomial on cocomparability graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2003.04.004openalex-snapshot
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.03.006openalex-snapshot
Path partition for graphs with special blocks
inferred← citeshttps://doi.org/10.1016/j.dam.2005.07.002openalex-snapshot
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.001openalex-snapshot
Finding a minimum path cover of a distance-hereditary graph in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.024openalex-snapshot
Computing and counting longest paths on circular-arc graphs in polynomial time
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.2022.01.021openalex-snapshot
Cyclability in graph classes
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114291openalex-snapshot
The decycling number of a line graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106646openalex-snapshot
Coloring hardness on low twin-width graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103754openalex-snapshot
On the structure of Hamiltonian graphs with small independence number
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.04.009openalex-snapshot
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.009openalex-snapshot
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.031openalex-snapshot
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115029openalex-snapshot
Parameterizing path partitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115301openalex-snapshot
Hamiltonian path in permutation graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00346-xopenalex-snapshot
Hamiltonian powers in threshold and arborescent comparability graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)80001-7openalex-snapshot
Weighted domination of cocomparability graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00577-7openalex-snapshot
On the k-path partition of graphs
inferred← citeshttps://doi.org/10.1023/a:1018931508072openalex-snapshot
On the minimum number of processors for scheduling problems with communicationdelays
inferred← citeshttps://doi.org/10.1137/100793529openalex-snapshot
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/11083856xopenalex-snapshot
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/15m1012396openalex-snapshot
On the Power of Graph Searching for Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/s0097539791200375openalex-snapshot
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/s1052623402410181openalex-snapshot
Radio Labeling with Preassigned Frequencies
inferred← citeshttps://doi.org/10.1145/3798129.3800747openalex-snapshot
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
inferred← citeshttps://doi.org/10.11606/d.45.2014.tde-10092014-045127openalex-snapshot
Caminhos mais longos em grafos
inferred← citeshttps://doi.org/10.15588/1607-3274-2023-1-13openalex-snapshot
METHOD OF ROUTING A GROUP OF MOBILE ROBOTS IN A FIXED NETWORK FOR SEARCHING THE MISSING OBJECTS IN A TECHNOLOGICAL DISASTER ZONE
inferred← citeshttps://doi.org/10.2139/ssrn.5146488openalex-snapshot
On the Structure of Hamiltonian Graphs with Small Independence Number
inferred← citeshttps://doi.org/10.30108/jcut.200809.0021openalex-snapshot
A Linear-Time Algorithm for the Terminal Path Cover Problem in Trees
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.00652openalex-snapshot
The d-Subtree Partition Problem
inferred← citeshttps://doi.org/10.46298/dmtcs.2082openalex-snapshot
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2306openalex-snapshot
Path covering number and L(2,1)-labeling number of graphs
inferred← citeshttps://doi.org/10.7939/r3s04hopenalex-snapshot
Minimum Degree Spanning Trees on Bipartite Permutation 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.