The following pages link to Point determination in graphs (Q2562192):
Displaying 27 items.
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- Join-irreducible Boolean functions (Q603893) (← links)
- Enumeration of point-determining graphs (Q618313) (← links)
- Connected obstructions to full graph homomorphisms (Q740288) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- Constructing and classifying neighborhood anti-Sperner graphs (Q998422) (← links)
- On minimal prime graphs and posets (Q1047188) (← links)
- The nucleus of a point determining graph (Q1225629) (← links)
- Graph with given achromatic number (Q1233029) (← links)
- Nuclei for totally point determining graphs (Q1245980) (← links)
- The edge nucleus of a point-determining graph (Q1247985) (← links)
- On 1-factors of point determining graphs (Q1254333) (← links)
- Gaps in full homomorphism order (Q1689952) (← links)
- 1-factors of point determining graphs (Q1844687) (← links)
- Line-critical point determining and point distinguishing graphs (Q1846434) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms (Q2346339) (← links)
- Best match graphs (Q2420450) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- A note on 1-factors of point determining graphs (Q3939842) (← links)
- Dacey Graphs (Q4073400) (← links)
- Full-homomorphisms to paths and cycles (Q6177408) (← links)