Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 238423 - MaRDI portal

scientific article; zbMATH DE number 238423

From MaRDI portal
Publication:5287862

zbMath0783.05085MaRDI QIDQ5287862

Qinglin Yu

Publication date: 5 August 1993


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



Related Items (35)

Generalization of matching extensions in graphs. II.Characterizing \(2k\)-critical graphs and \(n\)-extendable graphsGeneralization of matching extensions in graphs. IV: Closures\((a,b,k)\)-critical graphsCharacterizing defect \(n\)-extendable bipartite graphs with different connectivitiesOn Cartesian product of factor-critical graphsMinimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphsOn the extendability of quasi-strongly regular graphs with diameter 2Maximizing the minimum and maximum forcing numbers of perfect matchings of graphsThe extendability of matchings in strongly regular graphsMatching connectivity: on the structure of graphs with perfect matchingsHamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivityThe maximum matching extendability and factor-criticality of 1-planar graphsMinimally \(k\)-factor-critical graphs for some large \(k\)Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-criticalMatching extension and distance spectral radiusMinimum degree of minimal \((n-10)\)-factor-critical graphsUnnamed ItemThe classification of \(2\)-extendable edge-regular graphs with diameter \(2\)Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphsSome results on fractional \(n\)-factor-critical graphsMax-cut and extendability of matchings in distance-regular graphsPerfect matchings and \(K_{1,p}\)-restricted graphsGeneralization of matching extensions in graphs. IIIA new degree condition for graphs to have \([a,b\)-factor] ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphsOn extendability of co-edge-regular graphs4-factor-criticality of vertex-transitive graphs3-Factor-Criticality of Vertex-Transitive GraphsMinimum \(k\)-critical bipartite graphsCharacterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphsA note on \(m\)-near-factor-critical graphsBinding number and minimum degree for the existence of \((g,f,n)\)-critical graphsOn edge-colored graphs covered by properly colored cyclesOn extendability of Deza graphs with diameter 2




This page was built for publication: