scientific article; zbMATH DE number 6127683

MaRDI QIDQ4903414zbMATH OpenFDO

Authors Zhongyuan Che, Zhibo Chen

Publication date 21 January 2013

zbMATH Keywords

perfect matchingsurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(31)

• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• The minimum forcing number of perfect matchings in the hypercube
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• Forcing and anti-forcing edges in bipartite graphs
• Anti-forcing polynomials for benzenoid systems with forcing edges
• Plane elementary bipartite graphs with forcing or anti-forcing edges
• Continuous forcing spectra of even polygonal chains
• Complete forcing numbers of hexagonal systems
• Colouring non-even digraphs
• Some tight bounds on the minimum and maximum forcing numbers of graphs
• Continuous forcing spectrum of regular hexagonal polyhexes
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• Complete forcing numbers of hexagonal systems. II
• Some novel minimax results for perfect matchings of hexagonal systems
• Complete forcing numbers of catacondensed hexagonal systems
• A maximum resonant set of polyomino graphs
• A minimax result for perfect matchings of a polyomino graph
• Matching forcing polynomials of constructable hexagonal systems
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• Complete forcing numbers of graphs
• Anti-forcing numbers of perfect matchings of graphs
• Complete forcing numbers of complete and almost-complete multipartite graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• Colouring non-even digraphs
• Complete forcing numbers of the Rook's graphs
• Fractional forcing number of graphs
• Some novel minimax results for perfect matchings of polyomino graphs
• Computing the forcing spectrum of outerplanar graphs in polynomial time
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• On the anti-forcing number of graph powers

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 Q4903414)