scientific article

zbMATH Open1274.05162MaRDI QIDQ2857389

Hanno Lefmann, Carlos Hoppen, Yoshiharu Kohayakawa

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001454

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Hypergraphs with many Kneser colorings
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• On maximal paths and circuits of graphs
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES

This page was built for publication: