scientific article; zbMATH DE number 3141016
From MaRDI portal
Publication:3258698
zbMATH Open0086.16301MaRDI QIDQ3258698FDOQ3258698
Authors: C. Berge
Publication date: 1958
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- 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
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- A generalisation of matching and colouring
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs
- On star-packings having a large matching
- 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
- Characterization of saturated graphs related to pairs of disjoint matchings
- Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
- Precoloring extension involving pairs of vertices of small distance
- Spectral extrema of graphs with bounded clique number and matching number
- Ramsey numbers of large even cycles and fans
- Complexity of 2-rainbow total domination problem
- The maximal Aα-spectral radius of graphs with given matching number
- Matroid matching with Dilworth truncation
- The maximum genus, matchings and the cycle space of a graph
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2
- f-factors and related decompositions of graphs
- Title not available (Why is that?)
- On defect restricted matching extension graphs
- Connective Steiner 3-eccentricity index and network similarity measure
- The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs
- Maximum matching in almost linear time on graphs of bounded clique-width
- Strong chromatic index and Hadwiger number
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- A Hall-type theorem with algorithmic consequences in planar graphs
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- A unified combinatorial view beyond some spectral properties
- Title not available (Why is that?)
- On the chromatic number of matching Kneser graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Chvátal-Erdős conditions and almost spanning trails
- Additive stabilizers for unstable graphs
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- A note on maximum size of a graph without isolated vertices under the given matching number
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree
- On the chromatic number of certain highly symmetric graphs
- Bounds on maximum \(b\)-matchings
- Stirling numbers and records
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- Strong matching preclusion number of graphs
- Maximum balanced flow in a network
- Finding triangle-free 2-factors in general graphs
- Packing $k$-Matchings and $k$-Critical Graphs
- Matchings in 1‐planar graphs with large minimum degree
- An algorithmic approach to dual integrality of matching and extensions
- Triangles and (total) domination in subcubic graphs
- A note on the minimum size of matching-saturated graphs
- The maximum number of triangles in \(F_k\)-free graphs
- Maximum \((g,f)\)-factors of a general graph
- 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
- Nearly perfect matchings in uniform hypergraphs
- 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)
- 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
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)