On the number of maximally non-Hamiltonian graphs

DOI10.1023/B:MATN.0000030973.71346.2FzbMATH Open1051.05050OpenAlexW1975536114MaRDI QIDQ1889656FDOQ1889656

Authors: P. V. Roldugin 

Publication date: 7 December 2004

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:matn.0000030973.71346.2f

Recommendations

• Construction of maximally non-Hamiltonian graphs
• scientific article; zbMATH DE number 4043879
• scientific article; zbMATH DE number 1409195
• Smallest maximally nonhamiltonian graphs. II
• scientific article; zbMATH DE number 4160777

zbMATH Keywords

cliquesystem of linear inequalitiesHamiltonian circuitNon-Hamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30)

Cited In (10)

• Title not available (Why is that?)
• Construction of maximally non-Hamiltonian graphs
• Title not available (Why is that?)
• On the size of maximally non-Hamiltonian digraphs
• On Hamiltonian graphs with maximal index
• Smallest maximally nonhamiltonian graphs. II
• Large Isaacs' graphs are maximally non-Hamilton-connected
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-permitted journeys and Hamiltonian paths

This page was built for publication: On the number of maximally non-Hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889656)