Choice numbers of multi-bridge graphs

MaRDI QIDQ1650388zbMATH OpenFDO

Authors Benkam Bobga, Julian A. Allagan

Publication date 3 July 2018

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v25-n3/12504/

zbMATH Keywords

\(l\)-bridgechromatic-choosable graphlist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the choosability of some graphs
• Choice number of some complete multi-partite graphs
• On chromatic‐choosable graphs
• scientific article; zbMATH DE number 1123764
• Choosability and fractional chromatic numbers

Cites work

• 3-list-coloring planar graphs of girth 5
• A proof of a conjecture of Ohba
• Colorings and orientations of graphs
• Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1123764 (Why is no real title available?)
• scientific article; zbMATH DE number 5238998 (Why is no real title available?)
• List colourings of planar graphs
• On 3-choosability of plane graphs without 5-, 8- and 9-cycles
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• On chromatic‐choosable graphs
• On the choosability of some graphs
• The list chromatic index of a bipartite multigraph

Cited in

(1)

• scientific article; zbMATH DE number 2188340 (Why is no real title available?)

This page was built for publication: Choice numbers of multi-bridge graphs

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