A result about the incident edges in the graphs M_ k

DOI10.1016/0012-365X(93)90314-JMaRDI QIDQ1313883zbMATH OpenOpenAlexFDO

Authors Eduardo Montenegro, Reinaldo Salazar

Publication date 10 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90314-j

zbMATH Keywords

Hamiltonianincident edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 438460
• The number of cycles in a Hamilton graph
• MinimumK-hamiltonian graphs
• Publication:3469119
• scientific article; zbMATH DE number 4093499

Cites work

• Graphs of Degree Three with a Given Abstract Group
• Graphs with Given Group and Given Graph-Theoretical Properties
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3031989 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(2)

• On the \(k\)-edge-incident subgraph problem and its variants
• scientific article; zbMATH DE number 438460 (Why is no real title available?)

This page was built for publication: A result about the incident edges in the graphs \(M_ k\)

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