On n-extendable graphs
From MaRDI portal
Publication:1143417
DOI10.1016/0012-365X(80)90037-0zbMath0442.05060MaRDI QIDQ1143417
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
A note on tight cuts in matching-covered graphs ⋮ Hamiltonian cycles in n‐extendable graphs ⋮ Unnamed Item ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Edge proximity conditions for extendability in regular bipartite graphs ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Resonance graphs on perfect matchings of graphs on surfaces ⋮ Matching extension and distance spectral radius ⋮ The extendability of Cayley graphs generated by transpositions ⋮ On defect restricted matching extension graphs ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ On matching extendability of lexicographic products ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs ⋮ BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ Brace generation ⋮ 1-extendability of independent sets ⋮ Removable and forced subgraphs of graphs ⋮ 3-Factor-Criticality of Vertex-Transitive Graphs ⋮ Perfect matchings avoiding prescribed edges in a star-free graph ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs ⋮ On \((g,f)\)-uniform graphs ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ Complete forcing numbers of graphs ⋮ Extending subpermutation matrices in regular classes of matrices ⋮ Equistarable bipartite graphs ⋮ A polynomial algorithm for the extendability problem in bipartite graphs ⋮ Generalization of matching extensions in graphs. II. ⋮ Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ \(k\)-cycle resonant graphs ⋮ Two recursive theorems on \(n\)-extendibility ⋮ On 2-extendable abelian Cayley graphs ⋮ Matching extension and the genus of a graph ⋮ Matching extension and minimum degree ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ The 2-extendability of strongly regular graphs ⋮ Extending matchings in planar graphs. V ⋮ 1-extendability of independent sets ⋮ \((a,b,k)\)-critical graphs ⋮ High girth and extendability ⋮ Independence number in \(n\)-extendable graphs ⋮ Removable ears of 1-extendable graphs ⋮ Extendability and criticality in matching theory ⋮ 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ On the extendability of quasi-strongly regular graphs with diameter 2 ⋮ Equivalence classes in matching covered graphs ⋮ The extendability of matchings in strongly regular graphs ⋮ Matching connectivity: on the structure of graphs with perfect matchings ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ Planar \(k\)-cycle resonant graphs with \(k=1,2\) ⋮ On the restricted matching extension of graphs on the torus and the Klein bottle ⋮ Distance-restricted matching extendability of fullerene graphs ⋮ Reducible chains of planar 1-cycle resonant graphs ⋮ Connectivity of \(k\)-extendable graphs with large \(k\). ⋮ The matching extendability of surfaces ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Game matching number of graphs ⋮ Matching properties in domination critical graphs. ⋮ Kauffman's clock lattice as a graph of perfect matchings: a formula for its height ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Extending partial systems of distinct representatives ⋮ Face-width of Pfaffian braces and polyhex graphs on surfaces ⋮ The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) ⋮ Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs ⋮ Perfect matchings after vertex deletions ⋮ On the 2-extendability of planar graphs ⋮ On the matching extendability of graphs in surfaces ⋮ A new recursive theorem on \(n\)-extendibility ⋮ Matching extension in prism graphs ⋮ The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable ⋮ Classifying 2-extendable generalized Petersen graphs ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Extending matchings in planar graphs. IV ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Generalization of matching extensions in graphs. III ⋮ 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes ⋮ A lower bound on the number of removable ears of 1-extendable graphs ⋮ Characterizing minimally \(n\)-extendable bipartite graphs ⋮ Counting perfect matchings in \(n\)-extendable graphs ⋮ Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs ⋮ A new degree condition for graphs to have \([a,b\)-factor] ⋮ A note on internally disjoint alternating paths in bipartite graphs ⋮ Graphs with no \(M\)-alternating paths between two vertices: an update ⋮ On the restricted matching extension of graphs in surfaces ⋮ Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ On the extendability of certain semi-Cayley graphs of finite Abelian groups ⋮ On extendability of co-edge-regular graphs ⋮ On 2-extendable quasi-abelian Cayley graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ Bipartite matching extendable graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimal elementary bipartite graphs
- Parallel concepts in graph theory
- On a Family of Planar Bicritical Graphs
- On Representatives of Subsets
- A theorem on connected graphs in which every edge belongs to a 1-factor
- On the structure of factorizable graphs
- The Factorization of Linear Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: On n-extendable graphs
