Pages that link to "Item:Q1112837"
From MaRDI portal
The following pages link to Problems and results in combinatorial analysis and graph theory (Q1112837):
Displaying 50 items.
- Problems and results in extremal combinatorics. III. (Q286750) (← links)
- Existence of rainbow matchings in strongly edge-colored graphs (Q294535) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 (Q519218) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- On induced matchings (Q687143) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- List strong edge coloring of planar graphs with maximum degree 4 (Q1732781) (← links)
- A note on strong edge coloring of sparse graphs (Q1734962) (← links)
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable (Q1744746) (← links)
- Books in graphs (Q1765610) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On the rational Turán exponents conjecture (Q1998761) (← links)
- Strong chromatic index of \(k\)-degenerate graphs (Q2017054) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors (Q2094384) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- On strong edge-coloring of claw-free subcubic graphs (Q2117528) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- List strong edge-coloring of graphs with maximum degree 4 (Q2174601) (← links)
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs (Q2216926) (← links)
- Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics (Q2250288) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Combinatorial and graph-theoretical problems and augmenting technique (Q2315581) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- On a problem of Erdős and Rothschild on edges in triangles (Q2448958) (← links)
- Research problems from the 20th British Combinatorial Conference (Q2470428) (← links)