scientific article; zbMATH DE number 1286491

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199808)28:4<203::AID-JGT2>3.0.CO;2-N" /><203::AID-JGT2>3.0.CO;2-N 10.1002/(SICI)1097-0118(199808)28:4<203::AID-JGT2>3.0.CO;2-NzbMath0919.05054MaRDI QIDQ4242938

Jinjiang Yuan

Publication date: 11 May 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

extendableinduced matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (13)

Induced matching extendable graph powers ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ The extendability of Cayley graphs generated by transpositions ⋮ Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Unnamed Item ⋮ Degree conditions of induced matching extendable graphs ⋮ 4-regular claw-free IM-extendable graphs ⋮ Bipartite matching extendable graphs ⋮ Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 ⋮ Distance matching extension in cubic bipartite graphs ⋮ Edge-deletable IM-extendable graphs with minimum number of edges

This page was built for publication: