On defect-d matchings in graphs

DOI10.1016/0012-365X(75)90085-0zbMath0304.05120OpenAlexW2053904585MaRDI QIDQ1216323

Douglas D. Grant, Charles H. C. Little, Derek Holton

Publication date: 1975

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(75)90085-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (27)

Regular factors in vertex-deleted subgraphs of regular graphs ⋮ On 2-extendable abelian Cayley graphs ⋮ Matching extension and minimum degree ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Matchings in benzene chains ⋮ Explicit matchings in the middle levels of the Boolean lattice ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Codes associated with the odd graphs ⋮ Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 ⋮ On Petersen's graph theorem ⋮ On defect restricted matching extension graphs ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ On matching extendability of lexicographic products ⋮ Matchings in regular graphs ⋮ On the maximum matchings of regular multigraphs ⋮ Vertex-deleted subgraphs and regular factors from regular graph ⋮ Codes and designs from triangular graphs and their line graphs ⋮ A note on graphs contraction-critical with respect to independence number ⋮ The existential transversal property: A generalization of homogeneity and its impact on semigroups ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ On the comparison of incompatibility of split systems across different numbers of taxa ⋮ Multidecompositions of line graphs of complete graphs ⋮ Minimum degree of minimal defect \(n\)-extendable bipartite graphs ⋮ Matchings in pentagonal chains ⋮ On edge-colored graphs covered by properly colored cycles ⋮ Approximating the number of monomer-dimer coverings of a lattice. ⋮ Sufficient conditions for a graph to have factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• A theorem on connected graphs in which every edge belongs to a 1-factor
• Connectivity of transitive graphs
• Matchings in graphs
• The Factorization of Linear Graphs

This page was built for publication: On defect-d matchings in graphs