On the chromatic number of powers of subdivisions of graphs

DOI10.1016/J.DAM.2024.10.002MaRDI QIDQ6648291

Silas Rathke, Juanjo Rué, Simona Boyadzhiyska, Michael Anastos

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberpower of a graphsubdivision of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On colorings of graph fractional powers
• On graphs critical with respect to edge-colourings
• Star arboricity
• A bound on the total chromatic number
• On incidence coloring and star arboricity of graphs
• Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
• Hall's theorem for hypergraphs
• Coloring 3-power of 3-subdivision of subcubic graph
• Graph colouring and the probabilistic method
• Simultaneous coloring of vertices and incidences of outerplanar graphs
• Total colorings-a survey
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: On the chromatic number of powers of subdivisions of graphs

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