On the tree representation of chordal graphs

DOI10.1002/JGT.3190120313MaRDI QIDQ3800055zbMATH OpenOpenAlexFDO

Authors Yukio Shibata

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120313

zbMATH Keywords

chordal graphsclique treesoverlap clique graphtree representation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Clique Graphs of Chordal and Path Graphs
• scientific article; zbMATH DE number 4114651
• scientific article; zbMATH DE number 554762
• The clique-separator graph for chordal graphs
• scientific article; zbMATH DE number 2170436

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Incidence matrices and interval graphs

Cited in

(36)

• The clique-separator graph for chordal graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• Representing triangulated graphs in stars
• Clique covering and clique partition in generalizations of line graphs
• Clique tree generalization and new subclasses of chordal graphs
• An implementation of the iterative proportional fitting procedure by propagation trees.
• Clique trees of infinite locally finite chordal graphs
• Intersection graphs of Helly families of subtrees
• Block-indifference graphs: characterization, structural and spectral properties
• The vertex leafage of chordal graphs
• On the correspondence between tree representations of chordal and dually chordal graphs
• Characterization of classical graph classes by weighted clique graphs
• An efficient representation of chordal graphs
• Tree decomposition and discrete optimization problems: a survey
• Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
• Complexity and approximability of the happy set problem
• Clique representations and dimension-k chordal graphs
• End simplicial vertices in path graphs
• Comparing trees characteristic to chordal and dually chordal graphs
• k-separator chordal graphs: leafage and subfamilies
• Minimum average distance clique trees
• Strictly interval graphs: characterization and linear time recognition
• TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS
• Reduced clique graphs of chordal graphs
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Clique Graphs of Chordal and Path Graphs
• scientific article; zbMATH DE number 2170436 (Why is no real title available?)
• scientific article; zbMATH DE number 4114651 (Why is no real title available?)
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• Finding cut-vertices in the square roots of a graph
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Chordal graphs and their clique graphs
• Graphs with at most two moplexes
• Atoms versus avoiding simplicial vertices
• Recognition of chordal graphs and cographs which are cover-incomparability graphs
• A new characterization of unichord-free graphs

This page was built for publication: On the tree representation of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800055)