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

DOI10.1002/JGT.23125MaRDI QIDQ6642507

Gexin Yu, Daniel W. Cranston

Publication date: 24 November 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

graph coloringsquaresdegeneracyclique numbermaximum average degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Clique number of the square of a line graph
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The square of a planar cubic graph is 7-colorable
• Coloring squares of graphs with mad constraints
• On coloring numbers of graph powers
• A unified approach to distance-two colouring of graphs on surfaces
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph
• Coloring, list coloring, and painting squares of graphs (and other related problems)
• Bounding clique size in squares of planar graphs

This page was built for publication: Cliques in squares of graphs with maximum average degree less than 4

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