scientific article; zbMATH DE number 3232667

Cited in

(81)

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

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)