Minimum node covers and 2-bicritical graphs
From MaRDI portal
Cites work
- Determining the Chromatic Number of a Graph
- Determining the Stability Number of a Graph
- scientific article; zbMATH DE number 3784946 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Integer Programming: Methods, Uses, Computations
- Maximum matching and a polyhedron with 0,1-vertices
- On colouring random graphs
- On the integer-valued variables in the linear vertex packing problem
- Some remarks on the theory of graphs
- The Factors of Graphs
- Vertex packings: Structural properties and algorithms
Cited in
(26)- Random near-regular graphs and the node packing problem
- An exact threshold theorem for random graphs and the node-packing problem
- Regularisable graphs, II
- The maximum clique problem
- Capacities of graphs and \(2\)-matchings
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Pseudo-Hamiltonian-connected graphs
- Persistency of linear programming relaxations for the stable set problem
- New results relating independence and matchings
- Sharp lower bounds on the fractional matching number
- Crown reductions for the minimum weighted vertex cover problem
- Berge's theorem for the maximum charge problem
- Spectral radius and fractional matchings in graphs
- A decomposition algorithm for linear relaxation of the weightedr-covering problem
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Determining the number of internal stability of a graph
- Persistency of linear programming relaxations for the stable set problem
- Why is maximum clique often easy in practice?
- The core of a graph
- Sets of r-graphs that color all r-graphs
- On the determinant of Kőnig-Egerváry graphs
- The core-forcing principle for perfect flowers
- The SD-KE decomposition through the Larson matching interface
- New structural bounds for \(\operatorname{ker}(G)\) and \(\operatorname{core}(G)\)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- The difference and ratio of the fractional matching number and the matching number of graphs
This page was built for publication: Minimum node covers and 2-bicritical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050138)
