Two-step graphs of trees
type: Item
instance of: scholarly article
title: Two-step graphs of trees
zbMATH Open document ID: 0790.05023
DOI: 10.1016/0012-365X(93)90122-A
author: J. Richard Lundgren
author: Craig Rasmussen
published in: Discrete Mathematics
publication date: 1994-06-09T00:00:00Z
review text: Two-steps graphs (see the review Zbl 0790.05036 below) of trees are examined in two contexts. First, they are considered as competition graphs, and necessary and sufficient conditions are given for the competition graph of a tree to be an interval graph. Then, the problem of constructing the tree \(T\) from its two-step graph \(S_ 2(T)\) is considered. A class of trees where this is possible is found.
reviewed by: Martin Škoviera
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 444646
zbMATH Keywords: trees
zbMATH Keywords: competition graphs
zbMATH Keywords: interval graph
zbMATH Keywords: two-step graph
MaRDI profile type: Publication
cites work: Q3803157
cites work: Q3472123
cites work: A characterization of competition graphs
cites work: Q3875953
cites work: Q3328583
cites work: Inverting graphs of rectangular matrices
cites work: Q3767385
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Q3977585
cites work: Interval competition graphs of symmetric digraphs
cites work: Q5284037
cites work: Q3689222
Wikidata QID: Q127097238
description: scientific article; zbMATH DE number 444646