scientific article; zbMATH DE number 3232667

Cited in

(89)

Random assignment under weak preferences
Hadwiger's conjecture for proper circular arc graphs
Bounding the size of equimatchable graphs of fixed genus
On constructive methods in the theory of colour-critical graphs
The enumeration problem for color critical linear hypergraphs
A structure theorem for maximum internal matchings in graphs
Matching theory -- a sampler: From Dénes König to the present
On the linear k-arboricity of cubic graphs
The colour theorems of Brooks and Gallai extended
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
On the triangle vertex Folkman numbers
Critical graphs with connected complements
Bargaining in a network of buyers and sellers.
Colour-critical graphs with few edges
A 2-approximation algorithm for the minimum weight edge dominating set problem
Critical $(P_6, \mathrm{banner})$-free graphs
How (not) to integrate blood subtyping technology to kidney exchange
($\Delta-k$)-critical graphs
Toughness and matching extension in graphs
A generalisation of matching and colouring
Dispersing obnoxious facilities on a graph
Independent sets in $n$-vertex $k$-chromatic $\ell $-connected graphs
Kidney exchange with immunosuppressants
Maximum matching in almost linear time on graphs of bounded clique-width
A refined Gallai-Edmonds structure theorem for weighted matching polynomials
Continuous facility location on graphs
On the dichromatic number of surfaces
Point partition numbers: decomposable and indecomposable critical graphs
Smallest $C_{2 \ell + 1}$-critical graphs of odd-girth $2 k + 1$
The minimum number of edges in 4-critical digraphs of given order
Irreducible decomposition of powers of edge ideals
Generalized hypergraph coloring
An Edmonds-Gallai-type decomposition for the $j$-restricted $k$-matching problem
Hajós and Ore constructions for digraphs
Bounded clique cover of some sparse graphs
On DP-coloring of graphs and multigraphs
Decomposition theorems for square-free 2-matchings in bipartite graphs
Triangle packings and transversals of some $K_{4}$-free graphs
A proof of Tomescu's graph coloring conjecture
Linear hypergraphs with large transversal number and maximum degree two
Kidney exchange: further utilization of donors via listed exchange
A modified greedy algorithm for dispersively weighted 3-set cover
Fractional matchings, component-factors and edge-chromatic critical graphs
Structure in sparse k-critical graphs
Extended Gallai's theorem
Gallai-Edmonds decomposition as a pruning technique
Coloring immersion-free graphs
A hypergraph version of the Gallai-Edmonds Theorem
Altruistically unbalanced kidney exchange
Remarks on a conjecture of Barát and Tóth
Hyperbolic families and coloring graphs on surfaces
Packing $k$-Matchings and $k$-Critical Graphs
Ore's conjecture on color-critical graphs is almost true
Graph stabilization: a survey
On the vertex Folkman numbers $F_v(\underbrace{2,\dots,2}_R;R-1)$ and $F_v(\underbrace{2,\dots,2}_R;R-2)$
Continuous facility location on graphs
The orientable genus of the join of a cycle and a complete graph
Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
Efficient stabilization of cooperative matching games
Kidney exchange: an egalitarian mechanism
Popular matchings with ties and matroid constraints
On Ramsey minimal graphs
$k$-critical graphs in $P_5$-free graphs
k-critical graphs in P₅-free graphs
A density bound for triangle‐free 4‐critical graphs
On Density of $\boldsymbol{\mathbb{Z}_3}$ -Flow-Critical Graphs
On -diperfect digraphs with stability number two
Various bounds on the minimum number of arcs in a k-dicritical digraph
Some results on $k$-critical $P_5$-free graphs
A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
Cup stacking in graphs
On the minimum number of arcs in $k$-dicritical oriented graphs
A note on the stability results of the number of cliques in graphs with given matching number
Kempe equivalent list colorings revisited
Subdivisions in dicritical digraphs with large order or digirth
Characterizing 4-critical graphs with Ore-degree at most seven
Triangle Ramsey numbers of complete graphs
Total coloring graphs with large maximum degree
Irreducible decomposition of powers of edge ideals, computing dstab, astab.
Approximating -covering
Regularity of normal Rees algebras of edge ideals of graphs
Proper interval vertex colorings of graphs
The 3-dicritical semi-complete digraphs
Critically paintable, choosable or colorable graphs
The chromatic gap and its extremes
A lower bound on the number of edges in DP-critical graphs
Finite dualities and map-critical graphs on a fixed surface
Spectral aspects of symmetric matrix signings
Minimal connected -critical hypergraphs

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