Graphs with a 3-cycle-2-cover

DOI10.1007/S00373-014-1516-ZzbMath1327.05172OpenAlexW2012398666MaRDI QIDQ897268

Hong-Jian Lai, Mingquan Zhan, Miaomiao Han, Zhi-Hong Chen

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1516-z

zbMATH Keywords

reductionnowhere zero flowscollapsible graphs3-cycle-2-cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• Edge-connectivity and edge-disjoint spanning trees
• The reduction of graph families closed under contraction
• Graphs without spanning closed trails
• Flows and generalized coloring theorems in graphs
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Spanning Eulerian subgraphs of 2-edge-connected graphs
• The traveling salesman problem on cubic and subcubic graphs
• Double cycle covers and the petersen graph
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Video Deblurring Algorithm Using Accurate Blur Kernel Estimation and Residual Deconvolution Based on a Blurred-Unblurred Frame Pair
• A Contribution to the Theory of Chromatic Polynomials
• Graph family operations

This page was built for publication: Graphs with a 3-cycle-2-cover