Pages that link to "Item:Q841163"
From MaRDI portal
The following pages link to On the complexity of cover-incomparability graphs of posets (Q841163):
Displaying 16 items.
- Cover-incomparability graphs and 2-colored diagrams of posets (Q514748) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- Cover-incomparability graphs of posets (Q1013992) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Undecidability of Winkler's \(r\)-neighborhood problem for covering digraphs (Q1322019) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Ptolemaic and chordal cover-incomparability graphs (Q2140993) (← links)
- Characterizing subclasses of cover-incomparability graphs by forbidden subposets (Q2314427) (← links)
- Cographs which are cover-incomparability graphs of posets (Q2351716) (← links)
- Which \(k\)-trees are cover-incomparability graphs? (Q2440118) (← links)
- Which distance-hereditary graphs are cover-incomparability graphs? (Q2446853) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Incidence posets and cover graphs (Q2510383) (← links)
- Ptolemaic and planar cover-incomparability graphs (Q2665829) (← links)
- Nonuniform complexity classes, decision graphs and homological properties of posets (Q3741053) (← links)
- Composition and product of cover-incomparability graphs (Q5058204) (← links)