scientific article; zbMATH DE number 3232667
From MaRDI portal
zbMath0144.23204MaRDI QIDQ5520564
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the dichromatic number of surfaces, Bounded clique cover of some sparse graphs, On DP-coloring of graphs and multigraphs, A generalisation of matching and colouring, Continuous Facility Location on Graphs, Gallai-Edmonds decomposition as a pruning technique, Point partition numbers: decomposable and indecomposable critical graphs, On the linear \(k\)-arboricity of cubic graphs, The colour theorems of Brooks and Gallai extended, Coloring immersion-free graphs, Minimal connected \(\tau\)-critical hypergraphs, Hyperbolic families and coloring graphs on surfaces, Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\), Fractional matchings, component-factors and edge-chromatic critical graphs, On constructive methods in the theory of colour-critical graphs, The minimum number of edges in 4-critical digraphs of given order, Irreducible decomposition of powers of edge ideals, Decomposition theorems for square-free 2-matchings in bipartite graphs, Triangle packings and transversals of some \(K_{4}\)-free graphs, Structure in sparse \(k\)-critical graphs, A density bound for triangle‐free 4‐critical graphs, Altruistically unbalanced kidney exchange, Unnamed Item, Remarks on a conjecture of Barát and Tóth, Popular Matchings with Ties and Matroid Constraints, A proof of Tomescu's graph coloring conjecture, On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs, On \(\chi \)-diperfect digraphs with stability number two, The enumeration problem for color critical linear hypergraphs, Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph, Some results on \(k\)-critical \(P_5\)-free graphs, A new lower bound on the number of edges in colour-critical graphs and hypergraphs, Packing $k$-Matchings and $k$-Critical Graphs, On the triangle vertex Folkman numbers, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, Critical graphs with connected complements, Linear hypergraphs with large transversal number and maximum degree two, Generalized hypergraph coloring, Kidney exchange: further utilization of donors via listed exchange, Ore's conjecture on color-critical graphs is almost true, Bargaining in a network of buyers and sellers., Critical \((P_6, \mathrm{banner})\)-free graphs, A structure theorem for maximum internal matchings in graphs, Characterizing 4-critical graphs with Ore-degree at most seven, Matching theory -- a sampler: From Dénes König to the present, Efficient stabilization of cooperative matching games, How (not) to integrate blood subtyping technology to kidney exchange, Kidney exchange: an egalitarian mechanism, (\(\Delta-k\))-critical graphs, A modified greedy algorithm for dispersively weighted 3-set cover, On Ramsey minimal graphs, Critically paintable, choosable or colorable graphs, The chromatic gap and its extremes, Graph Stabilization: A Survey, Dispersing obnoxious facilities on a graph, Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, \(k\)-critical graphs in \(P_5\)-free graphs, \(k\)-critical graphs in \(P_5\)-free graphs, The orientable genus of the join of a cycle and a complete graph, Random assignment under weak preferences, Kidney exchange with immunosuppressants, Hajós and Ore constructions for digraphs, Hadwiger's conjecture for proper circular arc graphs, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Finite dualities and map-critical graphs on a fixed surface, Toughness and matching extension in graphs, Bounding the size of equimatchable graphs of fixed genus, Spectral aspects of symmetric matrix signings, Colour-critical graphs with few edges, Extended Gallai's Theorem, Maximum matching in almost linear time on graphs of bounded clique-width, A hypergraph version of the Gallai-Edmonds Theorem, A 2-approximation algorithm for the minimum weight edge dominating set problem, A refined Gallai-Edmonds structure theorem for weighted matching polynomials, Continuous facility location on graphs
