scientific article; zbMATH DE number 6116733
From MaRDI portal
Publication:4897434
Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- scientific article; zbMATH DE number 1131873
- scientific article; zbMATH DE number 1043893
- Some Results on Fractional Graph Theory
- On fractional \((f,n)\)-critical graphs
- On fractional domination numbers in graphs
- On fractional \((g,f,n)\)-critical graphs.
- A remark about fractional \((f,n)\)-critical graphs
- A note on fractional covers of a graph
- Fractional \(\ell\)-factors in regular graphs
- Some results on fractional n-factor-critical graphs
Cited in
(40)- Exact recovery with symmetries for the doubly stochastic relaxation
- scientific article; zbMATH DE number 7559412 (Why is no real title available?)
- Fractional, circular, and defective coloring of series-parallel graphs
- On vertex-disjoint paths in regular graphs
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
- Fractional chromatic numbers of tensor products of three graphs
- Fractional minimal rank
- Distributed algorithms for fractional coloring
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- Orienting Borel graphs
- On fractional fragility rates of graph classes
- Positive and negative square energies of graphs
- Membership criteria and containments of powers of monomial ideals
- Optimizing periodic patrols against short attacks on the line and other networks
- Resource convertibility and ordered commutative monoids
- State-independent contextuality sets for a qutrit
- Fractional dominating parameters
- Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
- Fractional zero forcing via three-color forcing games
- Coloring graphs by translates in the circle
- Large independent sets in subquartic planar graphs
- Graphs with minimum fractional domatic number
- Fractional coloring of triangle-free planar graphs
- Information theoretic parameters of noncommutative graphs and convex corners
- Circular coloring and fractional coloring in planar graphs
- Coloring distance graphs on the plane
- Graph information ratio
- A unified construction of semiring-homomorphic graph invariants
- Distributed coloring and the local structure of unit-disk graphs
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- Integer sequence discovery from small graphs
- Spanning trees with leaf distance at least \(d\)
- The complexity of pattern counting in directed graphs, parameterised by the outdegree
- Large independent sets in triangle-free planar graphs
- Perfect fractional matchings in \(k\)-out hypergraphs
- Symmetric graphs with respect to graph entropy
- Induced equators in flag spheres
- Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
- Colouring non-even digraphs
- Fractional isomorphism of graphons
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 Q4897434)
