Pages that link to "Item:Q2272401"
From MaRDI portal
The following pages link to Some classes of graphs that are not PCGs (Q2272401):
Displaying 10 items.
- Graphs that are not pairwise compatible: a new proof technique (extended abstract) (Q1670981) (← links)
- A method for enumerating pairwise compatibility graphs with a given number of vertices (Q1983131) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Some reduction operations to pairwise compatibility graphs (Q2338220) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs (Q4910554) (← links)
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs (Q5892362) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)