Constructing featured supereulerian graph

DOI10.1080/09720529.2021.2005232zbMATH Open1502.05116OpenAlexW4313214096MaRDI QIDQ5059618FDOQ5059618

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

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

zbMATH Keywords

matchingminimum degreeconnected graphconnectivitysupereulerian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

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

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)