On the hamiltonian path graph of a graph
From MaRDI portal
Recommendations
Cited in
(26)- Mutually orthogonal Hamiltonian connected graphs
- A note on the Hamiltonian circuit problem on directed path graphs
- An anti-Ramsey theorem on cycles
- scientific article; zbMATH DE number 4130411 (Why is no real title available?)
- scientific article; zbMATH DE number 438460 (Why is no real title available?)
- Characterizations of highly path-Hamiltonian graphs
- scientific article; zbMATH DE number 3849265 (Why is no real title available?)
- scientific article; zbMATH DE number 3869375 (Why is no real title available?)
- Category-I maximal graphs with given number of path-Hamilton edges
- Independence, radius and Hamiltonian paths
- scientific article; zbMATH DE number 3991546 (Why is no real title available?)
- scientific article; zbMATH DE number 4021183 (Why is no real title available?)
- scientific article; zbMATH DE number 4091550 (Why is no real title available?)
- scientific article; zbMATH DE number 95322 (Why is no real title available?)
- Graphs maximal with respect to absence of hamiltonian paths
- scientific article; zbMATH DE number 742658 (Why is no real title available?)
- Line graphs of bipartite graphs with Hamiltonian paths
- On minimum degree in Hamiltonian path graphs
- scientific article; zbMATH DE number 976076 (Why is no real title available?)
- Hamilton paths in graphs whose vertices are graphs
- Hamilton cycles in the path graph of a set of points in convex position
- Triangle-different Hamiltonian paths
- Extending cycles in graphs
- Path extendable graphs
- Hamiltonicity of complements of middle graphs
- Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
This page was built for publication: On the hamiltonian path graph of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3803149)