Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On characterization of Hamiltonian graphs

From MaRDI portal
Publication:1225064
Jump to:navigation, search

DOI10.1016/S0095-8956(78)80009-4zbMath0325.05111OpenAlexW2094636165MaRDI QIDQ1225064

Cornelis Hoede, Henk Jan Veldman

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(78)80009-4



Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (4)

Contraction theorems in Hamiltonian graph theory ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian ⋮ Existence of dominating cycles and paths ⋮ Contracting to a longest path in H-free graphs



Cites Work

  • Unnamed Item


This page was built for publication: On characterization of Hamiltonian graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1225064&oldid=13299953"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 08:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki