Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs

ISSN： 0209-9683

Source： Combinatorica, Vol.28, Iss.3, 2008-05, pp. : 315-323

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Roman domination on strongly chordal graphs

By Liu Chun-Hung Chang Gerard

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 608-619

Springer Publishing Company

Access to resources Recommend Favorite

Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders

By Leck Uwe

Combinatorica, Vol. 24, Iss. 2, 2004-04 ,pp. : 305-312

Springer Publishing Company

Access to resources Recommend Favorite

A new approach to chordal graphs

By Nebeský Ladislav

Czechoslovak Mathematical Journal, Vol. 57, Iss. 1, 2007-03 ,pp. : 465-471

Springer Publishing Company

Access to resources Recommend Favorite

Covariance selection for nonchordal graphs via chordal embedding

By Dahl Joachim Vandenberghe Lieven Roychowdhury Vwani

Optimization Methods and Software, Vol. 23, Iss. 4, 2008-08 ,pp. : 501-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

Linear time construction of 5-phylogenetic roots for tree chordal graphs

By Kennedy William Kong Hui Lin Guohui Yan Guiying

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 94-106

Springer Publishing Company

Access to resources Recommend Favorite