Lai's conditions for spanning and dominating closed trails
From MaRDI portal
Publication:2260637
zbMath1308.05067MaRDI QIDQ2260637
Wei-Guo Chen, Mei Lu, Zhi-Hong Chen
Publication date: 11 March 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p62
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Fan-type conditions for spanning Eulerian subgraphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- On a closure concept in claw-free graphs
- Supereulerian graphs, independent sets, and degree-sum conditions
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- The traveling salesman problem on cubic and subcubic graphs
- Properties of Catlin's reduced graphs and supereulerian graphs
- A note on graphs spanned by Eulerian graphs
- On circuits and pancyclic line graphs
- A reduction method to find spanning Eulerian subgraphs
- Hamiltonian line graphs
- On Spanning and Dominating Circuits in Graphs
- The spanning subgraphs of eulerian graphs
- Collapsible graphs and matchings
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Supereulerian graphs and the Petersen graph
This page was built for publication: Lai's conditions for spanning and dominating closed trails
