scientific article; zbMATH DE number 986968

DOI10.1002/(SICI)1097-0118(199703)24:3%3C233::AID-JGT4%3E3.0.CO;2-QzbMATH Open0868.05025MaRDI QIDQ3122897FDOQ3122897

Author name not available (Why is that?)

Publication date: 18 August 1997

Title of this publication is not available (Why is that?)

Recommendations

• The choosability of some 4-reduced plane graphs
• A not 3-choosable planar graph without 3-cycles
• scientific article; zbMATH DE number 890665

zbMATH Keywords

865planar graphvertex coloringlist-colorable

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (18)

• A not 3-choosable planar graph without 3-cycles
• The 4-choosability of plane graphs without 4-cycles
• A simple algorithm for 4-coloring 3-colorable planar graphs
• On Non 3-Choosable Bipartite Graphs
• The Alon-Tarsi number of two kinds of planar graphs
• Title not available (Why is that?)
• DP-4-coloring of planar graphs with some restrictions on cycles
• Smaller planar triangle-free graphs that are not 3-list-colorable
• On structure of some plane graphs with application to choosability
• Facial list colourings of plane graphs
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• Multiple list colouring of planar graphs
• List precoloring extension in planar graphs
• On two problems of defective choosability of graphs
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs
• List coloring of planar graphs with forbidden cycles
• Choosability in signed planar 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 Q3122897)