Graphs with a 3-cycle-2-cover
From MaRDI portal
Publication:897268
DOI10.1007/S00373-014-1516-ZzbMATH Open1327.05172OpenAlexW2012398666MaRDI QIDQ897268FDOQ897268
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Contribution to the Theory of Chromatic Polynomials
- Graphs without spanning closed trails
- A reduction method to find spanning Eulerian subgraphs
- Flows and generalized coloring theorems in graphs
- 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)
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)
