Bounding clique size in squares of planar graphs

DOI10.1016/J.EJC.2024.103960MaRDI QIDQ6568835zbMATH OpenFDO

Authors Daniel W. Cranston

Publication date 8 July 2024

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

Full work available at URL https://doi.org/10.1016/J.EJC.2024.103960

zbMATH Keywords

\(k\)-degenerate graphWegner conjecture

Mathematics Subject Classification ID

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

Recommendations

• A bound on the chromatic number of the square of a planar graph
• Coloring the square of maximal Planar graphs with diameter two
• List Colouring Squares of Planar Graphs
• New upper bound on the chromatic number of the square of a planar graph

Cites work

• A bound on the chromatic number of the square of a planar graph
• A unified approach to distance-two colouring of graphs on surfaces
• An introduction to the discharging method via graph coloring
• Coloring Powers of Planar Graphs
• Coloring the square of a planar graph
• Coloring, list coloring, and painting squares of graphs (and other related problems)
• Covering planar graphs with forests
• scientific article; zbMATH DE number 1882350 (Why is no real title available?)
• Largest planar graphs of diameter two and fixed maximum degree
• List Colouring Squares of Planar Graphs
• On the existence of specific stars in planar graphs

Cited in

(2)

• Cliques in squares of graphs with maximum average degree less than 4
• Tight upper bound on the clique size in the square of 2-degenerate graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568835)