scientific article; zbMATH DE number 1131873
From MaRDI portal
Publication:4382863
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
Cited in
(only showing first 100 items - show all)- On a conjecture for the university timetabling problem
- Some new bounds for cover-free families through biclique covers
- \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs
- On the expressive power of linear algebra on graphs
- The rank of a signed graph
- Generalized fractional and circular total colorings of graphs
- On coloring the arcs of biregular graphs
- On the ultimate lexicographic Hall-ratio
- Graph imperfection. II
- The fractional chromatic number, the Hall ratio, and the lexicographic product
- The fractional strong metric dimension in three graph products
- A note on maximum fractional matchings of graphs
- scientific article; zbMATH DE number 7566062 (Why is no real title available?)
- Asymptotic values of the Hall-ratio for graph powers
- Characterizations of maximum fractional \((g,f)\)-factors of graphs
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Fractional Matchings of Graphs
- Signless Laplacian spectral radius and fractional matchings in graphs
- Consequences of the packing problem
- Counterexamples to a Conjecture of Harris on Hall Ratio
- Fractional matching preclusion of graphs
- Measurable sets with excluded distances
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
- Rank, term rank and chromatic number of a graph
- Maximum fractional factors in graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Fractional matching preclusion number of graphs
- Some results on binding number and fractional perfect matching
- Semi-supervised clustering via multi-level random walk
- Some relations among term rank, clique number and list chromatic number of a graph
- Integer \(k\)-matchings of graphs
- The Waldschmidt constant for squarefree monomial ideals
- Fractional matching preclusion for arrangement graphs
- Coloring the Cartesian sum of graphs
- The fractional dimension of subsets of Boolean lattices and cartesian products
- On fractional Ramsey numbers
- On multichromatic numbers of widely colorable graphs
- A game of hide and seek in networks
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
- Strong resolving graphs: the realization and the characterization problems
- Coloring the vertices of a graph with measurable sets in a probability space
- On the fractional chromatic number of monotone self-dual Boolean functions
- On maximal energy of line graphs with given parameters
- Fractional matching preclusion numbers of Cartesian product graphs
- Fractional matching number and eigenvalues of a graph
- Planar graphs are \(9/2\)-colorable
- How important are branching decisions: fooling MIP solvers
- Probabilistic refinement of the asymptotic spectrum of graphs
- On complexities of minus domination
- The fractional chromatic number of triangle-free subcubic graphs
- A note on fractional covers of a graph
- Generalized fractional total colorings of graphs
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Tile invariants: New horizons.
- Homomorphisms of binary Cayley graphs
- scientific article; zbMATH DE number 6116733 (Why is no real title available?)
- Spectral radius and fractional matchings in graphs
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- \(k\)-fold coloring of planar graphs
- The fractional metric dimension of permutation graphs
- Worst case analysis of a greedy algorithm for graph thickness
- Fractional aspects of the Erdős-Faber-Lovász conjecture
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- Randomly colouring graphs (a combinatorial view)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- Some results on fractional edge coloring of graphs.
- On the strong metric dimension of the strong products of graphs
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
- A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
- On fractional realizations of graph degree sequences
- Total \([1,2]\)-domination in graphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Some remarks on Hajós' conjecture
- The fractional \(k\)-truncated metric dimension of graphs
- The metric dimension of Cayley digraphs
- Graph imperfection. I
- Cyclic orderings and cyclic arboricity of matroids
- Resource-sharing system scheduling and circular chromatic number
- \(t\)-pebbling and extensions
- Strong resolving partitions for strong product graphs and Cartesian product graphs
- Arboricity games: the core and the nucleolus
- Toughness and the existence of fractional \(k\)-factors of graphs
- Gromov hyperbolicity in the Cartesian sum of graphs
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- Local chromatic number and distinguishing the strength of topological obstructions
- On fractional \((f,n)\)-critical graphs
- The fractional chromatic number of Zykov products of graphs
- The fractional metric dimension of graphs
- On the expressive power of linear algebra on graphs
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- On colorings of graph powers
- A note on semi-coloring of graphs
- Local chromatic number and Sperner capacity
- On the edge dimension and the fractional edge dimension of graphs
- Fractional dominations and fractional total dominations of graph complements
- Efficient random graph matching via degree profiles
- Independent sets in triangle-free cubic planar graphs
- Flipping triangles and rectangles
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)
