On the Extremal Number of Edges in Hamiltonian Graphs

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Journal of information science and engineering

• Publication date

  2011-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.6688/JISE.2011.27.5.9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Conditional fault Hamiltonicity of the complete graph

  2008cited by this paper
• Hyper hamiltonian laceability on edge fault star graph

  2004cited by this paper
• Optimal ring embedding in hypercubes with faulty links

  1992cited by this paper
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes

  1991cited by this paper
• Graph Theory with Applications

  1978cited by this paper
• Graph Theory with Applications

  1977cited by this paper
• On Hamilton's ideals

  1972cited by this paper
• Note on Hamilton Circuits

  1960cited by this paper
• Some Theorems on Abstract Graphs

  1952cited by this paper
• (1) 15* Remarks on a Paper of Pósa

  year unknowncited by this paper

• The maximum size of a nonhamiltonian-connected graph with given order and minimum degree

  2024cites this paper
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree

  2023cites this paper
• Generalizations of the classics to spanning connectedness

  2021cites this paper
• On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance

  2016influential citation
• On the extremal number of edges in hamiltonian connected graphs

  2010cites this paper