Graphs with a 3-cycle-2-cover

DOI10.1007/S00373-014-1516-ZzbMATH Open1327.05172OpenAlexW2012398666MaRDI QIDQ897268FDOQ897268

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

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

Recommendations

• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• scientific article; zbMATH DE number 26498
• Degree sums and graphs that are not covered by two cycles
• scientific article; zbMATH DE number 871189
• scientific article; zbMATH DE number 861405

zbMATH Keywords

reductionnowhere zero flowscollapsible graphs3-cycle-2-cover

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Coverability of graph by three odd subgraphs
• Three ways to cover a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897268)