scientific article
From MaRDI portal
Publication:3910557
zbMath0461.05047MaRDI QIDQ3910557
David Avis, Jin Akiyama, Hiroshi Era
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Degree sum conditions for path-factors with specified end vertices in bipartite graphs ⋮ Packings by Complete Bipartite Graphs ⋮ On matroids induced by packing subgraphs ⋮ Path factors in subgraphs ⋮ On factors with given components ⋮ \(P_3\)-factors in the square of a tree ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ Unnamed Item ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ Fractional matching, factors and spectral radius in graphs involving minimum degree ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ On caterpillar factors in graphs ⋮ Illuminating disjoint line segments in the plane ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ The existence of a path-factor without small odd paths ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs ⋮ Unnamed Item ⋮ Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs ⋮ Simple neighbourhoods in triple systems ⋮ On barrier sets of star-factors ⋮ Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs ⋮ Some results about component factors in graphs ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ The existence of path-factor covered graphs ⋮ A Tutte-Type Characterization for Graph Factors
This page was built for publication:
