On 3-edge-connected supereulerian graphs
From MaRDI portal
Publication:659686
DOI10.1007/S00373-010-0974-1zbMATH Open1235.05084OpenAlexW2030148137MaRDI QIDQ659686FDOQ659686
Authors: Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan 
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0974-1
Recommendations
line graphsupereulerian graphs3-edge-connected graph4-edge-connected graph5-edge-connencted graphspanning eulerian subgraph
Cites Work
- Graphs without spanning closed trails
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- A note on graphs spanned by Eulerian graphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- A Note on Sub-Eulerian Graphs
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
Cited In (12)
- A note on the maximum number of edges of a spanning Eulerian subgraph.
- Super-Eulerian graphs and the Petersen graph. II
- Title not available (Why is that?)
- Fan-type conditions for spanning Eulerian subgraphs
- On maximum number of edges in a spanning eulerian subgraph
- On finding spanning eulerian subgraphs
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Super 3-restricted edge connectivity of triangle-free graphs.
- Supereulerian 3-path-quasi-transitive digraphs
- Title not available (Why is that?)
- Supereulerian graphs and the Petersen graph
- Super \(\lambda_3\)-optimality of regular graphs
This page was built for publication: On 3-edge-connected supereulerian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659686)
