scientific article; zbMATH DE number 3211575
From MaRDI portal
Publication:5338785
zbMath0129.39802MaRDI QIDQ5338785
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
t-expansive and t-wise intersecting hypergraphs, Inequalities for minimal covering sets in set systems of given rank, A generalisation of matching and colouring, Conservative weightings and ear-decompositions of graphs, Minimal connected \(\tau\)-critical hypergraphs, Extremal graphs for blow-ups of keyrings, Large matchings from eigenvalues, On the maximum even factor in weakly symmetric graphs, Extremal graphs for edge blow-up of graphs, Irreducible decomposition of powers of edge ideals, Unnamed Item, The extendability of matchings in strongly regular graphs, Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity, Minimally \(k\)-factor-critical graphs for some large \(k\), Extremal hypergraphs for matching number and domination number, Minimum degree of minimal \((n-10)\)-factor-critical graphs, Graph factors, A short proof that matching matroids are transversal, Largest 2-regular subgraphs in 3-regular graphs, On Ramsey minimal graphs, The chromatic gap and its extremes, Spanning subgraphs with specified valencies. (Reprint), 4-factor-criticality of vertex-transitive graphs, A characterization of graphs with given maximum degree and smallest possible matching number, 3-Factor-Criticality of Vertex-Transitive Graphs, Factor-critical graphs with the minimum number of near-perfect matchings, Matchings in regular graphs from eigenvalues, On the König deficiency of zero-reducible graphs, Perfect matchings of a graph, Matchings and covers in hypergraphs, A note on \(m\)-near-factor-critical graphs, Associated primes of powers of edge ideals and ear decompositions of graphs, A characterization of graphs with given maximum degree and smallest possible matching number. II, A tight lower bound on the matching number of graphs via Laplacian eigenvalues, Matching criticality in intersecting hypergraphs, Critical paired dominating sets and irreducible decompositions of powers of edge ideals, Spanning subgraphs with specified valencies, A hypergraph version of the Gallai-Edmonds Theorem, Critical hypergraphs and interesting set-pair systems
