The following pages link to Legal coloring of graphs (Q1079578):
Displaying 17 items.
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Maximizing proper colorings on graphs (Q490999) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- Counting colorings of a regular graph (Q2345527) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Optimal graphs for chromatic polynomials (Q2483402) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- (Q5090894) (← links)
- Extremal graphs for homomorphisms (Q5199417) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- An Extremal Property of Turán Graphs, II (Q5417822) (← links)
- Extremal Graphs for Homomorphisms II (Q5418768) (← links)
- Resource efficient stabilization for local tasks despite unknown capacity links (Q6612539) (← links)
