"All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs."

Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri (2013)

> Home

Details and statistics

DOI: 10.1093/COMJNL/BXS087

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cj/CalamoneriFS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/CalamoneriFS13
Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri:
All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs. Comput. J. 56(7): 882-886 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.