On the size of maximally non-Hamiltonian digraphs

DOI10.26493/1855-3974.1291.EE9zbMATH Open1416.05166OpenAlexW2889771405WikidataQ129237200 ScholiaQ129237200MaRDI QIDQ5225023FDOQ5225023

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

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

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)

Cites Work

• Title not available (Why is that?)
• On a construction of Thomassen
• Hypohamiltonian and hypotraceable graphs
• On maximal circuits in directed graphs
• Title not available (Why is that?)
• An infinite family of planar hypohamiltonian oriented graphs
• Title not available (Why is that?)
• An infinite family of planar non-Hamiltonian bihomogeneously traceable oriented graphs
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Title not available (Why is that?)
• Variations on the Hamiltonian Theme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smallest maximally nonhamiltonian graphs
• Title not available (Why is that?)
• Smallest maximally nonhamiltonian graphs. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• On non-Hamiltonian graphs for which every vertex-deleted subgraph is traceable
• Non-isomorphic smallest maximally non-Hamiltonian graphs

Cited In (6)

• Non-isomorphic smallest maximally non-Hamiltonian graphs
• Construction of maximally non-Hamiltonian graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)