The following pages link to Trees with Hamiltonian square (Q5625198):
Displayed 34 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Characterization of co-blockers for simple perfect matchings in a convex geometric graph (Q368759) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- Cycles in squares of trees without generalized claws (Q383769) (← links)
- The circumference of the square of a connected graph (Q484548) (← links)
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph (Q489324) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- On graphs whose square have strong Hamiltonian properties (Q1043996) (← links)
- Interior graphs of maximal outerplane graphs (Q1059083) (← links)
- Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
- A necessary condition for the square of a graph to be Hamiltonian (Q1220945) (← links)
- Hamiltonian squares of cacti (Q1255968) (← links)
- Remarks on Hamiltonian properties of powers of digraphs (Q1329819) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- On the Hamiltonicity exponent of directed cacti (Q1356716) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Hamiltonicity in locally finite graphs: two extensions and a counterexample (Q1658750) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Trestles in the squares of graphs (Q1981662) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Graphs with 1-hamiltonian-connected cubes (Q2553448) (← links)
- The number of caterpillars (Q2562091) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- Graphs with cyclomatic number three having panconnected square (Q4595257) (← links)
- One node fault tolerance for caterpillars and starlike trees (Q4876347) (← links)
- Transversals in Trees (Q4920649) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)