Maxclique and unit disk characterizations of strongly chordal graphs | Zendy

Pablo De Caria | Zendy; Terry A. McKee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Maxclique and unit disk characterizations of strongly chordal graphs

Author(s) -

Pablo De Caria,

Terry A. McKee

Publication year - 2014

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1757

Subject(s) - chordal graph , interval graph , combinatorics , mathematics , unit disk graph , indifference graph , pathwidth , unit (ring theory) , graph , split graph , discrete mathematics , computer science , 1 planar graph , line graph , telecommunications , wireless network , mathematics education , wireless

Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research