scientific article
From MaRDI portal
Publication:4074931
zbMath0315.05123MaRDI QIDQ4074931
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Dirac's minimum degree condition restricted to claws, The partition of a uniform hypergraph into pairs of dependent hyperedges, Claw-free graphs---a survey, Matching extension in \(K_{1,r}\)-free graphs with independent claw centers, Eliminating graphs by means of parallel knock-out schemes, Graph factors and factorization: 1985--2003: a survey, Claw-free strictly Deza graphs, Quasi-claw-free graphs, Forbidden subgraphs generating a finite set, On the dimer problem of the vertex-edge graph of a cubic graph, Set graphs. IV. Further connections with claw-freeness, Even cycles and perfect matchings in claw-free plane graphs, Decomposing plane cubic graphs, Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\), Forbidden induced subgraphs for perfect matchings, A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs, On Perfect Matchings and Tilings in Uniform Hypergraphs, On cut vertices and eigenvalues of character graphs of solvable groups, Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian, Graphs with integer matching polynomial zeros, On matching and total domination in graphs, Path factors and parallel knock-out schemes of almost claw-free graphs, The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs, A pair of forbidden subgraphs and perfect matchings., Polynomial time algorithms for two classes of subgraph problem, Deficiency and forbidden subgraphs of connected, locally-connected graphs, The Ryjáček closure and a forbidden subgraph, Perfect matchings avoiding prescribed edges in a star-free graph, A survey on graphs with convex quadratic stability number, Vertex-disjoint stars in \(K_{1 , r}\)-free graphs, Zero forcing in claw-free cubic graphs, On barrier sets of star-factors, On matching extensions with prescribed and proscribed edge sets. II, Triangles in claw-free graphs, Odd factors of a graph, On the number of perfect matchings in the line graph of a traceable graph, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets, Extending matchings in graphs: A survey, Extending matchings in claw-free graphs
