On minimal elementary bipartite graphs
From MaRDI portal
Publication:1245978
DOI10.1016/0095-8956(77)90062-4zbMath0375.05036OpenAlexW2026055522MaRDI QIDQ1245978
László Lovász, Michael D. Plummer
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90062-4
Related Items
Handle bases and bounds on the number of subgraphs, \(k\)-cycle resonant graphs, Matching extension and the genus of a graph, Optimizing over a slice of the bipartite matching polytope, Regular coronoids and 4-tilings, Perfect matchings and ears in elementary bipartite graphs, On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix, On n-extendable graphs, Cycle-based formulations in distance geometry, Forcing faces in plane bipartite graphs, Planar \(k\)-cycle resonant graphs with \(k=1,2\), A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs, Cell rotation graphs of strongly connected orientations of plane graphs with an application, Embedding nearly decomposable matrices into certain staircase matrices, Reducible chains of planar 1-cycle resonant graphs, Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs, Extremal anti-forcing numbers of perfect matchings of graphs, Brace generation, Construction for bicritical graphs and \(k\)-extendable bipartite graphs, A cycle-based formulation for the distance geometry problem, Minimal 2-matching-covered graphs, Plane elementary bipartite graphs, Ear-decompositions of matching-covered graphs, Linear Transformations on Nonnegative Matrices Preserving Properties of Irreducibility and Full Indecomposability, Some tight bounds on the minimum and maximum forcing numbers of graphs
Cites Work
