Supereulerian graphs and matchings

DOI10.1016/j.aml.2011.05.008zbMath1234.05147OpenAlexW2092860795MaRDI QIDQ654204

Huiya Yan, Hong-Jian Lai

Publication date: 28 December 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.05.008

zbMATH Keywords

dominating closed trailsupereulerian graphindependent edges

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Spanning trails with variations of Chvátal-Erdős conditions ⋮ Constructing featured supereulerian graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Reduced graphs of diameter two ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ New bounds on Zagreb indices ⋮ Locally dense supereulerian digraphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• Graphs without spanning closed trails
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs

This page was built for publication: Supereulerian graphs and matchings