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 the expressive power of linear algebra on graphs
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- Consequences of the packing problem
- On the strong metric dimension of the strong products of graphs
- Fractional matching preclusion number of graphs
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- A note on coloring vertex-transitive graphs
- Fractional matching preclusion for (n,k)-star graphs
- Proof of a conjecture on fractional Ramsey numbers
- Asymptotic values of the Hall-ratio for graph powers
- Coloring the Cartesian sum of graphs
- On the expressive power of linear algebra on graphs
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- Computing the weighted isolated scattering number of interval graphs in polynomial time
- Some bounds on the injective chromatic number of graphs
- Independent domination, colorings and the fractional idomatic number of a graph
- Fractional matching preclusion number of graphs and the perfect matching polytope
- A conjecture on critical graphs and connections to the persistence of associated primes
- Fractional local edge dimensions of a graph
- Minimum fractional dominating functions and maximum fractional packing functions
- Remarks on fractional ID-\(k\)-factor-critical graphs
- A new property of the Lovász number and duality relations between graph parameters
- On the expressibility of the reconstructional color refinement
- Fractional matching preclusion of graphs
- On types of growth for graph-different permutations
- Fractional matchings in graphs from the spectral radius
- A note on fractional DP-coloring of graphs
- Spectral radius and fractional matchings in graphs
- Toughness and degree condition for fractional ID-k-factor-critical graphs
- Toughness and the existence of fractional k-factors of graphs
- How many attackers can selfish defenders catch?
- A game of hide and seek in networks
- Cyclic orderings and cyclic arboricity of matroids
- Strong resolving partitions for strong product graphs and Cartesian product graphs
- Fractional cocoloring of graphs
- Fractional restrained domination
- Homomorphisms from sparse graphs to the Petersen graph
- Arboricity games: the core and the nucleolus
- A sufficient condition for graphs to be fractional (k,m)-deleted graphs
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Structured Codes of Graphs
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Fractional total colourings of graphs of high girth
- On fractional realizations of graph degree sequences
- Some results on fractional n-factor-critical graphs
- On fractional \((f,n)\)-critical graphs
- On the edge dimension and the fractional edge dimension of graphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Some relations among term rank, clique number and list chromatic number of a graph
- Gromov hyperbolicity in the Cartesian sum of graphs
- On Kelley’s intersection numbers
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- On the fractional f-chromatic index of a graph
- The fractional strong metric dimension in three graph products
- Fractional graphs
- Graph imperfection. I
- Strong resolving graphs: the realization and the characterization problems
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- On maximal energy of line graphs with given parameters
- On complexities of minus domination
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
- Still Spinning: The Moser Spindle at Sixty
- Spectral radius and fractional perfect matchings in graphs
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
- Spotting trees with few leaves
- Total \([1,2]\)-domination in graphs
- A note on maximum fractional matchings of graphs
- Fractional \(f\)-edge cover chromatic index of graphs
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- t-pebbling and extensions
- The rank of a signed graph
- Conditional fractional matching preclusion number of graphs
- Some results on fractional edge coloring of graphs.
- Density and power graphs in graph homomorphism problem
- The simultaneous fractional dimension of graph families
- Randomly colouring graphs (a combinatorial view)
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- On colorings of graph powers
- Extremal functions for sparse minors
- scientific article; zbMATH DE number 1990717 (Why is no real title available?)
- Linear programming complementation
- Fractional and circular separation dimension of graphs
- A class of matchings and a related lattice
- The nullity of a graph with fractional matching number
- Homomorphisms of binary Cayley graphs
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- Fractional domatic, idomatic, and total domatic numbers of a graph
- The fractional dimension of subsets of Boolean lattices and cartesian products
- Achieving new upper bounds for the hypergraph duality problem through logic
- Efficient random graph matching via degree profiles
- The Waldschmidt constant for squarefree monomial ideals
- Fractional perfect matching and distance spectral radius in graphs
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for data center networks
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
- On the fractional strong metric dimension of graphs
- Rank, term rank and chromatic number of a graph
- On the fractional chromatic number of monotone self-dual Boolean functions
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)
