On some properties of suboptimal colorings of graphs

DOI10.1002/NET.10107zbMATH Open1059.68078OpenAlexW2025457119MaRDI QIDQ4458722FDOQ4458722

Authors: Ivo Blöchliger, Dominique De Werra 

Publication date: 15 March 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10107

Recommendations

• scientific article; zbMATH DE number 1052826
• Locally restricted colorings
• Coloring graphs with locally few colors
• Coloring graphs with sparse neighborhoods
• scientific article; zbMATH DE number 1885944

zbMATH Keywords

generalized neighborhoodsuboptimal graph colorings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Nombre chromatique et plus longs chemins d'un graphe

Cited In (3)

• Locally restricted colorings
• Minimal colorings for properly colored subgraphs
• Title not available (Why is that?)

This page was built for publication: On some properties of suboptimal colorings of graphs

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