scientific article

zbMATH Open0086.16301MaRDI QIDQ3258698FDOQ3258698

C. Berge

Publication date: 1958

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (only showing first 100 items - show all)

• Matching and edge-connectivity in regular graphs
• Some extremal graphs with respect to inverse degree
• Guarding disjoint triangles and claws in the plane
• Ramsey number of paths and connected matchings in Ore-type host graphs
• On the order of certain close to regular graphs without a matching of given size
• Conditional matching preclusion sets
• Sharp lower bounds on the fractional matching number
• Generalization of matching extensions in graphs. II.
• Spectral radius and fractional matchings in graphs
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Solving MAX-\(r\)-SAT above a tight lower bound
• Packings by Complete Bipartite Graphs
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• On defect-d matchings in graphs
• On generalized matching problems
• Large matchings from eigenvalues
• Cardinality constrained combinatorial optimization: complexity and polyhedra
• Disjoint \(A\)-paths in digraphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• The Nonnegative Node Weight j-Restricted k-Matching Problems
• Claw-free graphs. VI: Colouring
• Matchings in regular graphs from eigenvalues
• Protecting convex sets
• Bi-criteria and approximation algorithms for restricted matchings
• A pair of forbidden subgraphs and perfect matchings.
• Linear-time certifying algorithms for near-graphical sequences
• Matchings in benzene chains
• Matrices of zeros and ones with fixed row and column sum vectors
• A hypergraph version of the Gallai-Edmonds Theorem
• Degrees and matchings
• Illumination in the presence of opaque line segments in the plane
• Title not available (Why is that?)
• Spaces of symmetric matrices of bounded rank
• The Tuza–Vestergaard Theorem
• Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number
• Smallest close to regular bipartite graphs without an almost perfect matching
• Matching theory -- a sampler: From Dénes König to the present
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Packing seagulls
• On saturation games
• Saturation numbers for linear forests \(P_5\cup tP_2\)
• Location-domination and matching in cubic graphs
• An extension of Tutte's 1-factor theorem
• Matching preclusion number of graphs
• Undirected distances and the postman-structure of graphs
• Matroid matching and some applications
• A note on 1-planar graphs with minimum degree 7
• On the odd-minor variant of Hadwiger's conjecture
• Finding maximum square-free 2-matchings in bipartite graphs
• Generalization of matching extensions in graphs. IV: Closures
• On the relationship between the genus and the cardinality of the maximum matchings of a graph
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• Nearly Perfect Matchings in Uniform Hypergraphs
• Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
• Note on matching preclusion number of random graphs
• A short proof of Mader's \(\mathcal S\)-paths theorem
• Combinatorial games on a graph
• The difference and ratio of the fractional matching number and the matching number of graphs
• Some extremal results on the connective eccentricity index of graphs
• Matchings in pentagonal chains
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
• On the graphic matroid parity problem
• On the structure of factorizable graphs
• Spanning closed trails in graphs
• Irreducible triangulations of surfaces with boundary
• Generalization of matching extensions in graphs. III
• Spectral radius of graphs with given matching number
• A new linear programming algorithm - better or worse than the simplex method?
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• The binding number of a graph and its Anderson number
• Short proofs on the matching polyhedron
• Matchings in graphs from the spectral radius
• Spanning trails with variations of Chvátal-Erdős conditions
• Efficient stabilization of cooperative matching games
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Développements recents de la théorie des graphes
• A note on parity constrained orientations
• Matchings in higher-order Gabriel graphs
• Saturation numbers for linear forests $P_6 + tP_2$
• Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
• Approximate proof-labeling schemes
• Sur le nombre transversal des hypergraphes uniformes
• The maximum number of edges in a 3-graph not containing a given star
• Transversals in regular uniform hypergraphs
• On the maximum matchings of regular multigraphs
• A generalisation of matching and colouring
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs
• On the Chromatic Number of Matching Kneser Graphs
• THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• Decomposition theorems for square-free 2-matchings in bipartite graphs
• The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number
• Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
• Über ein graphentheoretisches Ergebnis von T. Gallai
• On maximal energy of line graphs with given parameters
• Indestructive deletions of edges from graphs
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
• Eigenvalues and [a,b]‐factors in regular graphs
• Group connectivity and matchings

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