Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC

In set theory without the axiom of choice (AC), we observe new relations of the following statements with weak choice principles. ∘ Plf,c (Every locally finite connected graph has a maximal independent set). ∘ Plc,c (Every locally countable connected graph has a maximal independent set). ∘ CAC^α₁ (If in a partially ordered set all antichains are finite and all chains have size α, then the set has size α) if α is regular. ∘ CWF (Every partially ordered set has a cofinal well-founded subset). ∘ P_G,H₂ (For any infinite graph G=(VG, EG) and any finite graph H=(VH, EH) on 2 vertices, if every finite subgraph of G has a homomorphism into H, then so has G). ∘ If G=(VG,EG) is a connected locally finite chordal graph, then there is an ordering ``$<$" of VG such that < v ,v\ ∈ EG\ is a clique for each v∈ VG.