Bounding clique size in squares of planar graphs

DOI10.1016/j.ejc.2024.103960zbMATH Open1543.05031MaRDI QIDQ6568835

Daniel W. Cranston

Publication date: 8 July 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-degenerate graphWegner conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• An introduction to the discharging method via graph coloring
• Largest planar graphs of diameter two and fixed maximum degree
• Covering planar graphs with forests
• A unified approach to distance-two colouring of graphs on surfaces
• On the existence of specific stars in planar graphs
• A bound on the chromatic number of the square of a planar graph
• List Colouring Squares of Planar Graphs
• Coloring Powers of Planar Graphs
• Coloring the square of a planar graph
• Coloring, list coloring, and painting squares of graphs (and other related problems)

Related Items (1)

Cliques in squares of graphs with maximum average degree less than 4

This page was built for publication: Bounding clique size in squares of planar graphs