Spanning subgraph with Eulerian components
From MaRDI portal
Publication:764890
DOI10.1016/j.disc.2011.11.003zbMath1237.05120MaRDI QIDQ764890
Zhaohong Niu, Hong-Jian Lai, Limning Xiong
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.003
05C75: Structural characterization of families of graphs
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Catlin’s reduced graphs with small orders, On extremal \(k\)-supereulerian graphs, Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of even factors in claw-free graphs
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- The upper bound of the number of cycles in a 2-factor of a line graph
- A reduction method to find spanning Eulerian subgraphs
- Supereulerian graphs: A survey