(2,t)-choosable graphs

zbMATH Open1313.05130MaRDI QIDQ2936718FDOQ2936718

Authors: W. Ruksasakchai, Kittikorn Nakprasit 

Publication date: 6 January 2015

Recommendations

• scientific article; zbMATH DE number 6374014
• On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
• On \((k,t)\)-choosability of graphs.
• On \(( 2 , r )\)-choosability of planar graphs without short cycles
• scientific article; zbMATH DE number 908794

zbMATH Keywords

graph coloringchoosability\((2,t)\)-choosable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (6)

• On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
• Every graph is \((2,3)\)-choosable
• On \((k,t)\)-choosability of graphs.
• Title not available (Why is that?)
• On \((4,2)\)-choosable graphs

This page was built for publication: \((2,t)\)-choosable graphs

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