scientific article; zbMATH DE number 3390835
From MaRDI portal
Publication:5659595
zbMath0247.05159MaRDI QIDQ5659595
Publication date: 1972
Full work available at URL: https://eudml.org/doc/30181
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Regular factors in regular graphs ⋮ Remarks on regular factors of regular graphs ⋮ Girth, oddness, and colouring defect of snarks ⋮ Power domination in cubic graphs and Cartesian products ⋮ Cut-edges and regular factors in regular graphs of odd degree ⋮ Decomposition of graphs with constraint on minimum degree ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ The extendability of matchings in strongly regular graphs ⋮ A superlinear bound on the number of perfect matchings in cubic bridgeless graphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ On Petersen's graph theorem ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Conditional matching preclusion for the arrangement graphs ⋮ \(k\) -factors in regular graphs ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Largest 2-regular subgraphs in 3-regular graphs ⋮ On defect-d matchings in graphs ⋮ Exponentially many perfect matchings in cubic graphs ⋮ Restricted 2-extendability of (3,6)-fullerenes ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ A note on 1-factors in graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Unnamed Item ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor ⋮ Edge-deletable IM-extendable graphs with minimum number of edges ⋮ The Edmonds-Gallai decomposition for matchings in locally finite graphs ⋮ Fano colourings of cubic graphs and the Fulkerson conjecture
Cites Work
This page was built for publication:
