The following pages link to Boram Park (Q333479):
Displaying 50 items.
- Consistency, population solidarity, and egalitarian solutions for TU-games (Q333480) (← links)
- The airport problem with capacity constraints (Q339922) (← links)
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- Improved bounds on the chromatic numbers of the square of Kneser graphs (Q393168) (← links)
- Population solidarity, population fair-ranking, and the egalitarian value (Q422350) (← links)
- The competition numbers of complete multipartite graphs with many partite sets (Q423931) (← links)
- A dice rolling game on a set of tori (Q426826) (← links)
- The competition number of a graph and the dimension of its hole space (Q427694) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
- The competition numbers of ternary Hamming graphs (Q548421) (← links)
- On Opsut's conjecture for hypercompetition numbers of hypergraphs (Q713325) (← links)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- The competition graphs of oriented complete bipartite graphs (Q908307) (← links)
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
- The Betti numbers of real toric varieties associated to Weyl chambers of type \(B\) (Q1688134) (← links)
- Shellable posets arising from the even subgraphs of a graph (Q1690043) (← links)
- List 3-dynamic coloring of graphs with small maximum average degree (Q1709543) (← links)
- Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
- On incidence choosability of cubic graphs (Q1999751) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- On toric ideals arising from signed graphs (Q2038910) (← links)
- Generalized list colouring of graphs (Q2053679) (← links)
- Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity (Q2110639) (← links)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles (Q2112664) (← links)
- Improvements on Hippchen's conjecture (Q2166288) (← links)
- Graph invariants and Betti numbers of real toric manifolds (Q2176810) (← links)
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice (Q2205110) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- On induced saturation for paths (Q2225408) (← links)
- Stable structure on safe set problems in vertex-weighted graphs (Q2225416) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Bipartite graphs whose squares are not chromatic-choosable (Q2260619) (← links)
- A Ramsey-type theorem for the matching number regarding connected graphs (Q2279970) (← links)
- Collapsibility of non-cover complexes of graphs (Q2290346) (← links)
- Pseudograph and its associated real toric manifold (Q2360950) (← links)
- A graph theoretic approach to the slot allocation problem (Q2362198) (← links)
- On the weighted safe set problem on paths and cycles (Q2420660) (← links)
- The \(m\)-step competition graphs of doubly partial orders (Q2430029) (← links)
- Competitively tight graphs (Q2441380) (← links)
- The competition number of the complement of a cycle (Q2446303) (← links)
- The competition hypergraphs of doubly partial orders (Q2448902) (← links)
- Coloring of the square of Kneser graph \(K(2k+r,k)\) (Q2631087) (← links)
- On star 5-colorings of sparse graphs (Q2656970) (← links)
- Odd coloring of sparse graphs and planar graphs (Q2689480) (← links)
- The competition numbers of Johnson graphs (Q2997604) (← links)
- THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE (Q3016157) (← links)
- On the hypercompetition numbers of hypergraphs (Q3166443) (← links)
- Cycles and p-competition graphs (Q3581935) (← links)