Supereulerian graphs with constraints on the matching number and minimum degree

DOI10.1007/S00373-020-02229-XMaRDI QIDQ2657064zbMATH OpenOpenAlexFDO

Authors Mansour J. Algefari, Hong-Jian Lai

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02229-x

zbMATH Keywords

contractionHamiltonian line graphmatchingminimum degreesupereulerian graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Supereulerian graphs and small matching number
• Supereulerian graphs and matchings
• A note on minimum degree conditions for supereulerian graphs
• Supereulerian line graphs
• Supereulerian graphs with few independent edges.

Cites work

• A note on graphs spanned by Eulerian graphs
• A note on Hamiltonian circuits
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Sufficient conditions for a digraph to be supereulerian
• Super-Eulerian graphs, collapsible graphs and matchings
• Supereulerian graphs and matchings
• 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
• TWO THEOREMS IN GRAPH THEORY

Cited in

(12)

• Eulerian subgraphs containing given vertices and hamiltonian line graphs
• Finding a -regular supergraph of minimum order
• A note on minimum degree conditions for supereulerian graphs
• Supereulerian line graphs
• A condition on Hamilton-connected line graphs
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
• On extremal k-supereulerian graphs
• Supereulerian graphs with few independent edges.
• Constructing featured supereulerian graph
• Supereulerian graphs and small matching number
• Forbidden pairs for connected even factors in supereulerian graphs
• Supereulerian graphs and matchings

This page was built for publication: Supereulerian graphs with constraints on the matching number and minimum degree

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