Forbidden pairs for connected even factors in supereulerian graphs

DOI10.1007/s00373-023-02658-4zbMath1518.05103OpenAlexW4378979806MaRDI QIDQ6115432

No author found.

Publication date: 12 July 2023

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

Full work available at URL: https://doi.org/10.1007/s00373-023-02658-4

zbMATH Keywords

Hamiltoniansupereulerian graphconnected even factor\(K_{1, s}\)-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden subgraphs for supereulerian and Hamiltonian graphs
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Connected even factors in claw-free graphs

This page was built for publication: Forbidden pairs for connected even factors in supereulerian graphs