Problems and results in combinatorial analysis and graph theory
From MaRDI portal
Publication:1112837
DOI10.1016/0012-365X(88)90196-3zbMath0661.05037OpenAlexW2138017804MaRDI QIDQ1112837
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(88)90196-3
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Problem books (00A07) Generalized Ramsey theory (05C55)
Related Items (69)
On certain degree-based irregularity indices of some nanotubes ⋮ On some degree-based irregularity indices of certain networks ⋮ Many Turán exponents via subdivisions ⋮ Existence of rainbow matchings in strongly edge-colored graphs ⋮ On the Extremal Number of Subdivisions ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ On the strong chromatic index of sparse graphs ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ List strong edge-coloring of graphs with maximum degree 4 ⋮ On the Maximum Number of Triangles in Wheel-Free Graphs ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ On strong edge-coloring of graphs with maximum degree 4 ⋮ Unnamed Item ⋮ Strong chromatic index and Hadwiger number ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Colouring squares of claw-free graphs ⋮ Distance colouring without one cycle length ⋮ Strong edge-coloring for cubic Halin graphs ⋮ Strong incidence coloring of outerplanar graphs ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ Unnamed Item ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} ⋮ 子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ On strong edge-coloring of graphs with maximum degree 5 ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ A new proof of the graph removal lemma ⋮ On strong edge-colouring of subcubic graphs ⋮ On the strong chromatic index of cyclic multigraphs ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ On a problem of Erdős and Rothschild on edges in triangles ⋮ Colouring Squares of Claw-free Graphs ⋮ Strong chromatic index of planar graphs with large girth ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Strong edge-colouring of sparse planar graphs ⋮ List strong edge coloring of planar graphs with maximum degree 4 ⋮ Approximability results for the maximum and minimum maximal induced matching problems ⋮ Irregularity indices for line graph of Dutch windmill graph ⋮ A note on strong edge coloring of sparse graphs ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Planar graphs with maximum degree 4 are strongly 19-edge-colorable ⋮ A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 ⋮ On induced matchings ⋮ On the rational Turán exponents conjecture ⋮ Books in graphs ⋮ Strong chromatic index of \(k\)-degenerate graphs ⋮ On distance-3 matchings and induced matchings ⋮ Odd graph and its applications to the strong edge coloring ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Strong cliques and forbidden cycles ⋮ Strong edge-coloring for jellyfish graphs ⋮ Strong list-chromatic index of subcubic graphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Relative Turán numbers for hypergraph cycles ⋮ Distance Colouring Without One Cycle Length ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Strong edge-coloring of planar graphs ⋮ Strong edge-coloring of planar graphs ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ The strong chromatic index of complete cubic Halin graphs ⋮ On Distance-3 Matchings and Induced Matchings ⋮ Squared Chromatic Number Without Claws or Large Cliques ⋮ Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors ⋮ From edge-coloring to strong edge-coloring ⋮ Strong edge coloring of Cayley graphs and some product graphs ⋮ On strong edge-coloring of claw-free subcubic graphs ⋮ Maximum induced matchings of random cubic graphs
Cites Work
This page was built for publication: Problems and results in combinatorial analysis and graph theory
