Henk Jan Veldman

From MaRDI portal
(Redirected from Henk Jan Veldman)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Heavy cycles in weighted graphs
Discussiones Mathematicae Graph Theory
2003-06-13Paper
Forbidden subgraphs that imply hamiltonian‐connectedness*
Journal of Graph Theory
2002-07-11Paper
Long cycles in 3-cyclable graphs
Discrete Mathematics
2000-08-28Paper
Pancyclicity of claw-free Hamiltonian graphs
Discrete Mathematics
2000-07-05Paper
Not every 2-tough graph is Hamiltonian
Discrete Applied Mathematics
2000-04-09Paper
Chordality and 2-factors in tough graphs
Discrete Applied Mathematics
2000-01-30Paper
Degree sums for edges and cycle lengths in graphs1997-11-03Paper
Cycles through subsets with large degree sums
Discrete Mathematics
1997-08-10Paper
A note on dominating cycles in 2-connected graphs
Discrete Mathematics
1997-06-22Paper
scientific article; zbMATH DE number 908781 (Why is no real title available?)1997-06-09Paper
\(D_ \lambda\)-cycles in 3-cyclable graphs
Graphs and Combinatorics
1997-01-13Paper
Toughness and longest cycles in 2-connected planar graphs1996-11-12Paper
On graphs satisfying a local ore-type condition1996-06-18Paper
scientific article; zbMATH DE number 861394 (Why is no real title available?)1996-05-19Paper
scientific article; zbMATH DE number 867682 (Why is no real title available?)1996-04-21Paper
scientific article; zbMATH DE number 822747 (Why is no real title available?)1995-12-03Paper
Long cycles in graphs with prescribed toughness and minimum degree
Discrete Mathematics
1995-07-24Paper
Pancyclicity of hamiltonian line graphs
Discrete Mathematics
1995-04-17Paper
Toughness, minimum degree, and the existence of 2‐factors
Journal of Graph Theory
1994-11-28Paper
Long cycles, degree sums and neighborhood unions
Discrete Mathematics
1994-07-04Paper
A generalization of Ore's Theorem involving neighborhood unions
Discrete Mathematics
1994-03-10Paper
On dominating and spanning circuits in graphs
Discrete Mathematics
1994-03-01Paper
Decomposition of bipartite graphs under degree constraints
Networks
1993-09-05Paper
Cycles containing all vertices of maximum degree
Journal of Graph Theory
1993-08-24Paper
Long paths and cycles in tough graphs
Graphs and Combinatorics
1993-06-29Paper
Cycles containing many vertices of large degree
Discrete Mathematics
1993-01-16Paper
Hamiltonian properties of graphs with large neighborhood unions
Discrete Mathematics
1992-06-28Paper
scientific article; zbMATH DE number 15353 (Why is no real title available?)1992-06-25Paper
Long dominating cycles and paths in graphs with large neighborhood unions
Journal of Graph Theory
1991-01-01Paper
scientific article; zbMATH DE number 4177108 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4177109 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4191710 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4137803 (Why is no real title available?)1990-01-01Paper
Long cycles in graphs with large degree sums
Discrete Mathematics
1990-01-01Paper
A generalization of a result of Häggkvist and Nicoghossian
Journal of Combinatorial Theory. Series B
1989-01-01Paper
A result on Hamiltonian line graphs involving restrictions on induced subgraphs
Journal of Graph Theory
1988-01-01Paper
scientific article; zbMATH DE number 4093495 (Why is no real title available?)1988-01-01Paper
Contractibility and NP-completeness
Journal of Graph Theory
1987-01-01Paper
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
Journal of Graph Theory
1987-01-01Paper
Existence of spanning and dominating trails and circuits
Journal of Graph Theory
1986-01-01Paper
scientific article; zbMATH DE number 3968612 (Why is no real title available?)1986-01-01Paper
ADAPTIVE ESTIMATION OF BINOMIAL PROBABILITIES UNDER MISCLASSIFICATION
Statistica Neerlandica
1984-01-01Paper
On maximum critically h-connected graphs
Discrete Mathematics
1984-01-01Paper
Existence of Dlambda-cycles and Dlambda-paths
Discrete Mathematics
1983-01-01Paper
Existence of dominating cycles and paths
Discrete Mathematics
1983-01-01Paper
Non-\(\kappa\)-critical vertices in graphs
Discrete Mathematics
1983-01-01Paper
Contraction theorems in Hamiltonian graph theory
Discrete Mathematics
1981-01-01Paper
On characterization of Hamiltonian graphs
Journal of Combinatorial Theory. Series B
1978-01-01Paper


Research outcomes over time


This page was built for person: Henk Jan Veldman