Graph coloring satisfying restraints

DOI10.1016/0012-365X(90)90113-VMaRDI QIDQ910410zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Amenable colorings
• Classifying coloring graphs
• Extremal restraints for graph colourings
• Restraints permitting the largest number of colourings
• On color critical graphs with large adaptable chromatic numbers

Cites work

• scientific article; zbMATH DE number 3361909 (Why is no real title available?)
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Colour-critical graphs and hypergraphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On critical subgraphs of colour-critical graphs
• Paths and Circuits in Critical Graphs
• Subgraphs of colour-critical graphs

Cited in

(5)

• Strategic Coloring of a Graph
• Coloring Graphs with Constraints on Connectivity
• Amenable colorings
• Restraints permitting the largest number of colourings
• Extremal restraints for graph colourings

This page was built for publication: Graph coloring satisfying restraints

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