scientific article; zbMATH DE number 3390835
From MaRDI portal
Publication:5659595
Cites work
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- scientific article; zbMATH DE number 3341035 (Why is no real title available?)
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- The Factorization of Linear Graphs
- Über die Zerlegung regulärer Streckenkomplexe ungerader
Cited in
(37)- Edge-deletable IM-extendable graphs with minimum number of edges
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- On Petersen's graph theorem
- On defect-d matchings in graphs
- A note on 1-factors in graphs
- Largest 2-regular subgraphs in 3-regular graphs
- Restricted 2-extendability of (3,6)-fullerenes
- Cubic graphs that cannot be covered with four perfect matchings
- Minimum \(k\)-critical bipartite graphs
- Girth, oddness, and colouring defect of snarks
- Power domination in cubic graphs and Cartesian products
- Decomposition of graphs with constraint on minimum degree
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Regular factors in regular graphs
- Cut-edges and regular factors in regular graphs of odd degree
- Short cycle covers on cubic graphs by choosing a 2-factor
- The extendability of matchings in strongly regular graphs
- Remarks on regular factors of regular graphs
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Max-cut and extendability of matchings in distance-regular graphs
- Fractional -factors in regular graphs
- Exponentially many perfect matchings in cubic graphs
- Perfect matchings in highly cyclically connected regular graphs
- Maximally edge‐connected realizations and Kundu's k k‐factor theorem
- Conditional matching preclusion for the arrangement graphs
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- On a conjecture that strengthens Kundu's k-factor theorem
- Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
- Higher order matching preclusion for regular interconnection networks
- Berge's conjecture for cubic graphs with small colouring defect
- Claw-free cubic graphs are (1,1,2,2)-colorable
- Claw-free minimal matching covered graphs
- The number of perfect matchings in a brick
- A note on cyclic connectivity and matching properties of regular graphs
- Fano colourings of cubic graphs and the Fulkerson conjecture
- \(k\) -factors in regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659595)
