scientific article; zbMATH DE number 6116733

zbMath1254.05003MaRDI QIDQ4897434

Daniel H. Ullman, Edward R. Scheinerman

Publication date: 19 December 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Linear programming (90C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (39)

Optimizing periodic patrols against short attacks on the line and other networks ⋮ State-independent contextuality sets for a qutrit ⋮ Fractional zero forcing via three-color forcing games ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ Exact Recovery with Symmetries for the Doubly Stochastic Relaxation ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Spanning trees with leaf distance at least \(d\) ⋮ 1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Perfect fractional matchings in \(k\)-out hypergraphs ⋮ Fractional coloring of triangle-free planar graphs ⋮ Coloring distance graphs on the plane ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Positive and negative square energies of graphs ⋮ Induced equators in flag spheres ⋮ Graph Information Ratio ⋮ Resource convertibility and ordered commutative monoids ⋮ Graphs with minimum fractional domatic number ⋮ Properties, proved and conjectured, of Keller, Mycielski, and queen graphs ⋮ Integer sequence discovery from small graphs ⋮ On fractional fragility rates of graph classes ⋮ Fractional chromatic numbers of tensor products of three graphs ⋮ Symmetric graphs with respect to graph entropy ⋮ On vertex-disjoint paths in regular graphs ⋮ Membership criteria and containments of powers of monomial ideals ⋮ Unnamed Item ⋮ Coloring graphs by translates in the circle ⋮ Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs ⋮ Large Independent Sets in Subquartic Planar Graphs ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Distributed coloring and the local structure of unit-disk graphs ⋮ Fractional minimal rank ⋮ A unified construction of semiring-homomorphic graph invariants ⋮ Fractional Dominating Parameters ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ Colouring non-even digraphs ⋮ Fractional isomorphism of graphons ⋮ Orienting Borel graphs ⋮ Distributed algorithms for fractional coloring

This page was built for publication: