scientific article; zbMATH DE number 6116733
From MaRDI portal
Publication:4897434
zbMATH Open1254.05003MaRDI QIDQ4897434FDOQ4897434
Authors: Edward Scheinerman, Daniel H. Ullman 
Publication date: 19 December 2012
Title of this publication is not available (Why is that?)
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
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)
Cited In (40)
- Title not available (Why is that?)
- Fractional, circular, and defective coloring of series-parallel graphs
- On vertex-disjoint paths in regular graphs
- Fractional chromatic numbers of tensor products of three graphs
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
- Fractional minimal rank
- Distributed algorithms for fractional coloring
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- Orienting Borel graphs
- Positive and negative square energies of graphs
- On fractional fragility rates of graph classes
- Resource convertibility and ordered commutative monoids
- Membership criteria and containments of powers of monomial ideals
- Optimizing periodic patrols against short attacks on the line and other networks
- 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
- Graphs with minimum fractional domatic number
- Coloring graphs by translates in the circle
- Large independent sets in subquartic planar graphs
- Circular coloring and fractional coloring in planar graphs
- Fractional coloring of triangle-free planar graphs
- Information theoretic parameters of noncommutative graphs and convex corners
- Coloring distance graphs on the plane
- Graph information ratio
- Distributed coloring and the local structure of unit-disk graphs
- A unified construction of semiring-homomorphic graph invariants
- 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
- Exact recovery with symmetries for the doubly stochastic relaxation
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)
