Pages that link to "Item:Q1123199"
From MaRDI portal
The following pages link to Chromatically optimal rigid graphs (Q1123199):
Displaying 19 items.
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- The core of a graph (Q686290) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- On the order of countable graphs (Q1404996) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
- Fractal property of the graph homomorphism order (Q2403692) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Cuts and bounds (Q2575795) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
