On the size of maximally non-Hamiltonian digraphs

DOI10.26493/1855-3974.1291.EE9MaRDI QIDQ5225023zbMATH OpenOpenAlexWikidataFDO

Authors Nicolas Lichiardopol, Carol T. Zamfirescu

Publication date 25 July 2019

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1291.ee9

zbMATH Keywords

maximally non-Hamiltonian digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12)

Recommendations

• On the number of maximally non-Hamiltonian graphs
• scientific article; zbMATH DE number 4066942
• scientific article; zbMATH DE number 1409195
• scientific article; zbMATH DE number 4160777
• scientific article; zbMATH DE number 4043879

Cites work

• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3819757 (Why is no real title available?)
• scientific article; zbMATH DE number 4043879 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3655970 (Why is no real title available?)
• scientific article; zbMATH DE number 3739566 (Why is no real title available?)
• scientific article; zbMATH DE number 125496 (Why is no real title available?)
• scientific article; zbMATH DE number 3577225 (Why is no real title available?)
• scientific article; zbMATH DE number 3592039 (Why is no real title available?)
• scientific article; zbMATH DE number 1409195 (Why is no real title available?)
• scientific article; zbMATH DE number 3893232 (Why is no real title available?)
• An infinite family of planar hypohamiltonian oriented graphs
• An infinite family of planar non-Hamiltonian bihomogeneously traceable oriented graphs
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Hypohamiltonian and hypotraceable graphs
• Non-isomorphic smallest maximally non-Hamiltonian graphs
• On a construction of Thomassen
• On maximal circuits in directed graphs
• On non-Hamiltonian graphs for which every vertex-deleted subgraph is traceable
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• Variations on the Hamiltonian Theme

Cited in

(6)

• Non-isomorphic smallest maximally non-Hamiltonian graphs
• Construction of maximally non-Hamiltonian graphs
• scientific article; zbMATH DE number 4066942 (Why is no real title available?)
• scientific article; zbMATH DE number 1052842 (Why is no real title available?)
• On the effective size of a non-Weyl graph
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li

This page was built for publication: On the size of maximally non-Hamiltonian digraphs

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