skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Minimum degree ensuring that a hypergraph is hamiltonian-connected
Award ID(s):
2153507 1937241
PAR ID:
10499242
Author(s) / Creator(s):
; ;
Publisher / Repository:
Elsevier
Date Published:
Journal Name:
European Journal of Combinatorics
Volume:
114
Issue:
C
ISSN:
0195-6698
Page Range / eLocation ID:
103782
Subject(s) / Keyword(s):
Berge cycles extremal hypergraph theory minimum degree.
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email