The following pages link to On graphs that are not PCGs (Q2512661):
Displaying 12 items.
- A method for enumerating pairwise compatibility graphs with a given number of vertices (Q1983131) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- Some reduction operations to pairwise compatibility graphs (Q2338220) (← links)
- Pairwise compatibility graphs: complete characterization for wheels (Q2424298) (← links)
- Multi-interval Pairwise Compatibility Graphs (Q2988811) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs (Q5890624) (← links)
- Characterizing star-PCGs (Q5916258) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)
