scientific article; zbMATH DE number 1131873
From MaRDI portal
Publication:4382863
zbMATH Open0891.05003MaRDI QIDQ4382863FDOQ4382863
Authors: Edward Scheinerman, Daniel H. Ullman 
Publication date: 24 March 1998
Title of this publication is not available (Why is that?)
Recommendations
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 (only showing first 100 items - show all)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- On the strong metric dimension of the strong products of graphs
- The Fractional Strong Metric Dimension of Graphs
- A note on coloring vertex-transitive graphs
- The fractional k-metric dimension of graphs
- Proof of a conjecture on fractional Ramsey numbers
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- On the expressive power of linear algebra on graphs
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- Some bounds on the injective chromatic number of graphs
- A conjecture on critical graphs and connections to the persistence of associated primes
- Minimum fractional dominating functions and maximum fractional packing functions
- A new property of the Lovász number and duality relations between graph parameters
- On types of growth for graph-different permutations
- Spectral radius and fractional matchings in graphs
- Strong resolving partitions for strong product graphs and Cartesian product graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Cyclic orderings and cyclic arboricity of matroids
- Arboricity games: the core and the nucleolus
- Homomorphisms from sparse graphs to the Petersen graph
- A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
- On the edge dimension and the fractional edge dimension of graphs
- Fractional total colourings of graphs of high girth
- Some results on fractional \(n\)-factor-critical graphs
- Matchings with few colors in colored complete graphs and hypergraphs
- On fractional realizations of graph degree sequences
- Gromov hyperbolicity in the Cartesian sum of graphs
- On fractional \((f,n)\)-critical graphs
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- On the fractional \(f\)-chromatic index of a graph
- Graph imperfection. I
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
- Total \([1,2]\)-domination in graphs
- Fractional \(f\)-edge cover chromatic index of graphs
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- Some results on fractional edge coloring of graphs.
- \(t\)-pebbling and extensions
- Islands in Graphs on Surfaces
- Density and power graphs in graph homomorphism problem
- Randomly colouring graphs (a combinatorial view)
- On colorings of graph powers
- Fractional and circular separation dimension of graphs
- Homomorphisms of binary Cayley graphs
- Efficient random graph matching via degree profiles
- On the fractional strong metric dimension of graphs
- The fractional metric dimension of graphs
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- The fractional \(k\)-truncated metric dimension of graphs
- The fractional chromatic number of Zykov products of graphs
- The metric dimension of Cayley digraphs
- Deterministic versus randomized adaptive test cover
- Worst case analysis of a greedy algorithm for graph thickness
- A note on the existence of fractional \(f\)-factors in random graphs
- \(k\)-fold coloring of planar graphs
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Tile invariants: New horizons.
- Resource-sharing system scheduling and circular chromatic number
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- A note on semi-coloring of graphs
- Local chromatic number and Sperner capacity
- On topological relaxations of chromatic conjectures
- Dot product representations of graphs
- Some remarks on Hajós' conjecture
- The multichromatic numbers of some Kneser graphs
- On toughness and fractional \((g,f,n)\)-critical graphs
- The fractional metric dimension of permutation graphs
- Independent sets in triangle-free cubic planar graphs
- Linear choosability of graphs
- Triangle-free graphs whose independence number equals the degree
- Title not available (Why is that?)
- Forbiddance and capacity
- Fractional aspects of the Erdős-Faber-Lovász conjecture
- Local chromatic number and distinguishing the strength of topological obstructions
- Fractional dominations and fractional total dominations of graph complements
- Flipping triangles and rectangles
- Consequences of the packing problem
- Fractional matching preclusion number of graphs
- Asymptotic values of the Hall-ratio for graph powers
- Coloring the Cartesian sum of graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Fractional matching preclusion of graphs
- A game of hide and seek in networks
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
- Some relations among term rank, clique number and list chromatic number of a graph
- The fractional strong metric dimension in three graph products
- Strong resolving graphs: the realization and the characterization problems
- On maximal energy of line graphs with given parameters
- On complexities of minus domination
- A note on maximum fractional matchings of graphs
- The rank of a signed graph
- The Waldschmidt constant for squarefree monomial ideals
- The fractional dimension of subsets of Boolean lattices and cartesian products
- Fractional Matchings of Graphs
- Counterexamples to a Conjecture of Harris on Hall Ratio
- Rank, term rank and chromatic number of a graph
- Fractional matching preclusion for arrangement graphs
- On the fractional chromatic number of monotone self-dual Boolean functions
- Measurable sets with excluded distances
- How important are branching decisions: fooling MIP solvers
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 Q4382863)
