On (4,1)^*-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles

MaRDI QIDQ5397194zbMATH OpenFDO

Authors Haihui Zhang

Publication date 19 February 2014

Full work available at URL http://www.emis.de/journals/CMUC/

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chorddefective choosabilitytoroidal graph

Mathematics Subject Classification ID

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

Recommendations

• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• A note on (3,1)^*-choosable toroidal graphs
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles

Cited in

(8)

• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
• Choosability of toroidal graphs without short cycles
• A note on (3,1)^*-choosable toroidal graphs
• Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
• The 4-choosability of toroidal graphs without intersecting triangles
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable

This page was built for publication: On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles

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