Graph coloring satisfying restraints

DOI10.1016/0012-365X(90)90113-VzbMath0696.05024OpenAlexW1969831528WikidataQ125975221 ScholiaQ125975221MaRDI QIDQ910410

N. E. Zubov

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90113-v

zbMATH Keywords

vertex colouringamenable graphproper k-restraintstrongly critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Amenable colorings ⋮ Restraints permitting the largest number of colourings

Cites Work

• Unnamed Item
• On critical subgraphs of colour-critical graphs
• Subgraphs of colour-critical graphs
• Colour-critical graphs and hypergraphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Paths and Circuits in Critical Graphs