Constructing featured supereulerian graph

DOI10.1080/09720529.2021.2005232MaRDI QIDQ5059618zbMATH OpenOpenAlexFDO

Authors Mansour J. Algefari

Publication date 23 December 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2021.2005232

zbMATH Keywords

matchingminimum degreeconnected graphconnectivitysupereulerian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Constructing a large class of supertough graphs
• Publication:4731211
• Supereulerian graphs: A survey
• scientific article; zbMATH DE number 1778387
• Supereulerian graphs and the Petersen graph
• scientific article; zbMATH DE number 26482
• Supereulerian graphs and the Petersen graph
• scientific article; zbMATH DE number 1369
• Supereulerian graphs and matchings
• On super edge-graceful Eulerian graphs

Cites work

• A note on Hamiltonian circuits
• A note on graphs spanned by Eulerian graphs
• Graph theory
• Matroidal root structure of skew polynomials over finite fields
• Sufficient conditions for a digraph to be supereulerian
• Super-Eulerian graphs, collapsible graphs and matchings
• Supereulerian graphs and matchings
• Supereulerian graphs with constraints on the matching number and minimum degree
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
• Supereulerian graphs: A survey
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• The Chvátal-Erdős condition for a graph to have a spanning trail
• The spanning subgraphs of eulerian graphs

This page was built for publication: Constructing featured supereulerian graph

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