scientific article; zbMATH DE number 68918
From MaRDI portal
Publication:4014627
Recommendations
Cited in
(54)- Circular digraph walks, k-balanced strings, lattice paths and Chebychev polynomials
- On 2-walks in chordal planar graphs
- A degree sum condition for graphs to be prism Hamiltonian
- On 2-connected spanning subgraphs with low maximum degree
- Spanning Eulerian subgraphs of bounded degree in triangulations
- Claw-free graphs---a survey
- Subgraphs of graphs on surfaces with high representativity
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
- The parity Hamiltonian cycle problem
- \([2,3]\)-factors in a 3-connected infinite planar graph.
- Walks in phylogenetic treespace
- Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs
- On the Hamiltonian property hierarchy of 3-connected planar graphs
- Spanning trees and spanning closed walks with small degrees
- Hamilton cycles in line graphs of 3-hypergraphs
- Thomassen's conjecture for line graphs of 3-hypergraphs
- The Chvátal-Erdős condition for prism-Hamiltonicity
- Bijective counting of Kreweras walks and loopless triangulations
- The computational complexity of the parallel knock-out problem
- The prism over the middle-levels graph is Hamiltonian
- On the pancyclicity of lexicographic products
- A note on interconnecting matchings in graphs
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Graph toughness from Laplacian eigenvalues
- Edge-dominating cycles, k-walks and Hamilton prisms in 2K₂-free graphs
- On hamiltonian cycles in the prism over the odd graphs
- Hamiltonicity and pancyclicity of generalized prisms
- Forbidden subgraphs and the existence of a 2-walk
- On the difficulty of finding walks of length k
- Closed walks and graphlets
- Walks in Path Graph on Four Vertices and Fibonacci Sequence
- Spanning closed walks and TSP in 3-connected planar graphs
- scientific article; zbMATH DE number 2104724 (Why is no real title available?)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
- Computing Tutte paths
- Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
- scientific article; zbMATH DE number 6269059 (Why is no real title available?)
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- scientific article; zbMATH DE number 4189769 (Why is no real title available?)
- Toughness and spanning trees in K4‐minor‐free graphs
- A forbidden pair for connected graphs to have spanning k‐trees
- Forbidden subgraphs and the existence of spanning k-trees
- Axiomatic characterization of the toll walk function of some graph classes
- On prism-Hamiltonian bipartite graphs
- Spanning trees: A survey
- On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
- How many conjectures can you stand? A survey
- On minimally t-tough graphs with t 1
- On prism-Hamiltonian bipartite graphs and toughness
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
- A note on k-walks in bridgeless graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014627)
