Person:1363685: Difference between revisions

From MaRDI portal
Person:1363685
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Henk Jan Veldman to Henk Jan Veldman: Duplicate
 
(No difference)

Latest revision as of 20:50, 12 December 2023

Available identifiers

zbMath Open veldman.henk-janMaRDI QIDQ1363685

List of research outcomes





PublicationDate of PublicationType
Heavy cycles in weighted graphs2003-06-13Paper
Forbidden subgraphs that imply hamiltonian‐connectedness*2002-07-11Paper
Long cycles in 3-cyclable graphs2000-08-28Paper
Pancyclicity of claw-free Hamiltonian graphs2000-07-05Paper
Not every 2-tough graph is Hamiltonian2000-04-09Paper
Chordality and 2-factors in tough graphs2000-01-30Paper
Degree sums for edges and cycle lengths in graphs1997-11-03Paper
Cycles through subsets with large degree sums1997-08-10Paper
A note on dominating cycles in 2-connected graphs1997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q48881041997-06-09Paper
\(D_ \lambda\)-cycles in 3-cyclable graphs1997-01-13Paper
Toughness and longest cycles in 2-connected planar graphs1996-11-12Paper
On graphs satisfying a local ore-type condition1996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48711261996-05-19Paper
https://portal.mardi4nfdi.de/entity/Q48737951996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48566261995-12-03Paper
Long cycles in graphs with prescribed toughness and minimum degree1995-07-24Paper
Pancyclicity of hamiltonian line graphs1995-04-17Paper
Toughness, minimum degree, and the existence of 2‐factors1994-11-28Paper
Long cycles, degree sums and neighborhood unions1994-07-04Paper
A generalization of Ore's Theorem involving neighborhood unions1994-03-10Paper
On dominating and spanning circuits in graphs1994-03-01Paper
Decomposition of bipartite graphs under degree constraints1993-09-05Paper
Cycles containing all vertices of maximum degree1993-08-24Paper
Long paths and cycles in tough graphs1993-06-29Paper
Cycles containing many vertices of large degree1993-01-16Paper
Hamiltonian properties of graphs with large neighborhood unions1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39719971992-06-25Paper
Long dominating cycles and paths in graphs with large neighborhood unions1991-01-01Paper
Long cycles in graphs with large degree sums1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010981990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010991990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113391990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34704931990-01-01Paper
A generalization of a result of Häggkvist and Nicoghossian1989-01-01Paper
A result on Hamiltonian line graphs involving restrictions on induced subgraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38206271988-01-01Paper
Contractibility and NP-completeness1987-01-01Paper
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian1987-01-01Paper
Existence of spanning and dominating trails and circuits1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357261986-01-01Paper
On maximum critically h-connected graphs1984-01-01Paper
ADAPTIVE ESTIMATION OF BINOMIAL PROBABILITIES UNDER MISCLASSIFICATION1984-01-01Paper
Non-\(\kappa\)-critical vertices in graphs1983-01-01Paper
Existence of Dlambda-cycles and Dlambda-paths1983-01-01Paper
Existence of dominating cycles and paths1983-01-01Paper
Contraction theorems in Hamiltonian graph theory1981-01-01Paper
On characterization of Hamiltonian graphs1978-01-01Paper

Research outcomes over time

This page was built for person: Henk Jan Veldman