Constructing featured supereulerian graph

DOI10.1080/09720529.2021.2005232zbMath1502.05116OpenAlexW4313214096MaRDI QIDQ5059618

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

matchingconnectivityminimum degreeconnected graphsupereulerian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

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

This page was built for publication: Constructing featured supereulerian graph