On graphs with restricted link graphs and the chromatic number at most 3

DOI10.21136/CPM.1988.108781zbMATH Open0655.05057OpenAlexW3048173574MaRDI QIDQ3801596FDOQ3801596

Authors: Halina Bielak 

Publication date: 1988

Full work available at URL: https://eudml.org/doc/19611

Recommendations

• scientific article; zbMATH DE number 3981199
• Chromatic number of graphs each path of which is 3-colourable
• Coloring graphs with locally few colors
• On circuits and subgraphs of chromatic graphs
• A note on graph colouring

zbMATH Keywords

chromatic numberj-link

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

This page was built for publication: On graphs with restricted link graphs and the chromatic number at most $3$

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