scientific article; zbMATH DE number 7442442

MaRDI QIDQ5016040zbMATH OpenFDO

Authors Haihui Zhang

Publication date 10 December 2021

zbMATH Keywords

choosabilitycycletoroidal graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6172651
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• A note on (3,1)^*-choosable toroidal graphs
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• A sufficient condition for a planar graph to be 3-choosable
• A sufficient condition for planar graphs to be (3,1)-choosable
• A new sufficient condition for a toroidal graph to be 4-choosable
• Edge choosablity and total choosability of toroidal graphs without intersecting triangles.

Cited in

(2)

• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A \((3,1)^*\)-choosable theorem on toroidal graphs

This page was built for publication:

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