Plane elementary bipartite graphs
From MaRDI portal
DOI10.1016/S0166-218X(00)00204-3zbMATH Open0957.05085WikidataQ127492209 ScholiaQ127492209MaRDI QIDQ1582086FDOQ1582086
Authors: Heping Zhang, Fuji Zhang 
Publication date: 8 March 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- 1-factors and characterization of reducible faces of plane elementary bipartite graphs
- Total Z-transformation graphs of perfect matching of plane bipartite graphs
- scientific article; zbMATH DE number 1792672
- \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs
- Perfect matchings and ears in elementary bipartite graphs
Cites Work
- Title not available (Why is that?)
- Matching theory
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Graph theory with applications
- Perfect matchings of polyomino graphs
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
- Perfect matchings in hexagonal systems
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- On n-extendable graphs
- Z-transformation graphs of perfect matchings of hexagonal systems
- Hexagonal systems with forcing edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending matchings in graphs: A survey
- When each hexagon of a hexagonal system covers it
- Generalized hexagonal systems with each hexagon being resonant
- On minimal elementary bipartite graphs
- \(k\)-cycle resonant graphs
- Title not available (Why is that?)
- The rotation graphs of perfect matchings of plane bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (78)
- Cell rotation graphs of strongly connected orientations of plane graphs with an application
- The graph of perfect matching polytope and an extreme problem
- Forcing faces in plane bipartite graphs
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- A maximum resonant set of polyomino graphs
- Decomposition theorem on matchable distributive lattices
- The anti-Kekulé number of graphs
- A minimax result for perfect matchings of a polyomino graph
- Regular generalized polyomino graphs
- Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
- Hexagonal resonance of (3,6)-fullerenes
- The global forcing number of the parallelogram polyhex
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- Maximal resonance of cubic bipartite polyhedral graphs
- On forcing matching number of boron-nitrogen fullerene graphs
- Maximally resonant polygonal systems
- Pattern formation by oblivious asynchronous mobile robots
- Bipartite matching extendable graphs
- A min-max result on outerplane bipartite graphs
- \(k\)-resonant toroidal polyhexes
- A complete characterization for \(k\)-resonant Klein-bottle polyhexes
- The forcing number of toroidal polyhexes
- Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
- Forcing matching numbers of fullerene graphs
- Perfect matchings of polyomino graphs
- 1-factors and characterization of reducible faces of plane elementary bipartite graphs
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
- Fibonacci-like cubes as \(Z\)-transformation graphs
- On maximal resonance of polyomino graphs
- Uniquely forced perfect matching and unique 3-edge-coloring
- Complete forcing numbers of primitive coronoids
- The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path.
- Complete forcing numbers of graphs
- Non-matchable distributive lattices
- Structure of Fibonacci cubes: a survey
- Cube-free resonance graphs
- Existence of perfect matchings in a plane bipartite graph
- \(k\)-resonance in toroidal polyhexes
- Complete forcing numbers of catacondensed hexagonal systems
- Complete forcing numbers of hexagonal systems
- Complete forcing numbers of hexagonal systems. II
- On the perfect matching graph defined by a set of cycles
- Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
- The \(B\)-model connection and mirror symmetry for Grassmannians
- Structural properties of resonance graphs of plane elementary bipartite graphs
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs
- \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs
- A characterization of the resonance graph of an outerplane bipartite graph
- Anti-forcing numbers of perfect matchings of graphs
- Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs
- A note on the number of perfect matchings of bipartite graphs
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph
- Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals
- Plane elementary bipartite graphs with forcing or anti-forcing edges
- The polyomino graphs whose resonance graphs have a 1-degree vertex
- Continuous forcing spectra of even polygonal chains
- Resonance graphs on perfect matchings of graphs on surfaces
- On plane bipartite graphs without fixed edges
- Title not available (Why is that?)
- Binary Coding of Resonance Graphs of Catacondensed Polyhexes
- Outerplane bipartite graphs with isomorphic resonance graphs
- Dehn coloring and the dimer model for knots
- Some novel minimax results for perfect matchings of hexagonal systems
- Peripheral convex expansions of resonance graphs
- Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
- Resonance graphs of catacondensed even ring systems
- Regular coronoids and 4-tilings
- Forcing and anti-forcing polynomials of a type of polyomino graphs
- Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles
- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs
This page was built for publication: Plane elementary bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582086)
