scholarly journals Strongly Even-Cycle Decomposable Graphs

2016 ◽  
Vol 84 (2) ◽  
pp. 158-175 ◽  
Author(s):  
Tony Huynh ◽  
Andrew D. King ◽  
Sang-il Oum ◽  
Maryam Verdian-Rizi
Keyword(s):  
2007 ◽  
Vol 35 (3) ◽  
pp. 1278-1323 ◽  
Author(s):  
Gérard Letac ◽  
Hélène Massam

Author(s):  
S. L. Lauritzen ◽  
T. P. Speed ◽  
K. Vijayan

AbstractWe define and investigate the notion of a decomposable hypergraph, showing that such a hypergraph always is conformal, that is, can be viewed as the class of maximal cliques of a graph. We further show that the clique hypergraph of a graph is decomposable if and only if the graph is triangulated and characterise such graphs in terms of a combinatorial identity.


2011 ◽  
Vol 6 (4) ◽  
pp. 829-846 ◽  
Author(s):  
Luke Bornn ◽  
Francois Caron

2005 ◽  
Vol 22 ◽  
pp. 451-454 ◽  
Author(s):  
Rafał Kalinowski ◽  
Monika Pilśniak ◽  
Mariusz Woźniak ◽  
Irmina Zioło

2012 ◽  
Vol 32 (4) ◽  
pp. 689 ◽  
Author(s):  
Olivier Baudon ◽  
Frédéric Gilbert ◽  
Mariusz Woźniak

Sign in / Sign up

Export Citation Format

Share Document