scientific article; zbMATH DE number 3492724
From MaRDI portal
Publication:4074931
Cited in
(47)- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- On matching extensions with prescribed and proscribed edge sets. II
- Odd factors of a graph
- Extending matchings in graphs: A survey
- Extending matchings in claw-free graphs
- 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
- Quasi-claw-free graphs
- Triangles in claw-free graphs
- On barrier sets of star-factors
- Forbidden induced subgraphs for perfect matchings
- On cut vertices and eigenvalues of character graphs of solvable groups
- Vertex-disjoint stars in \(K_{1 , r}\)-free graphs
- On the number of perfect matchings in the line graph of a traceable graph
- Deficiency and forbidden subgraphs of connected, locally-connected graphs
- Zero forcing in claw-free cubic graphs
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Claw-free strictly Deza graphs
- On matching and total domination in graphs
- A pair of forbidden subgraphs and perfect matchings.
- Perfect matchings avoiding prescribed edges in a star-free graph
- Even cycles and perfect matchings in claw-free plane graphs
- Polynomial time algorithms for two classes of subgraph problem
- Forbidden subgraphs generating a finite set
- Set graphs. IV. Further connections with claw-freeness
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- On perfect matchings and tilings in uniform hypergraphs
- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- A survey on graphs with convex quadratic stability number
- Graphs with integer matching polynomial zeros
- On the dimer problem of the vertex-edge graph of a cubic graph
- Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)
- Approximating maximum edge 2-coloring by normalizing graphs
- On the three graph invariants related to matching of finite simple graphs
- A Ramsey-type theorem on deficiency
- Approximating maximum edge 2-coloring by normalizing graphs
- On the number of perfect matchings of middle graphs
- Sharp mosaic dimension of matching toggle graphs, with an application to fibonaccenes
- The Ryjáček closure and a forbidden subgraph
- Extending unlocked matchings in graphs
- Enumerating perfect matchings in line graphs of graphs with pendent edges
- Eliminating graphs by means of parallel knock-out schemes
- Graph factors and factorization: 1985--2003: a survey
- Decomposing plane cubic graphs
- Path factors and parallel knock-out schemes of almost claw-free graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074931)