Two-step graphs of trees

DOI10.1016/0012-365X(93)90122-AzbMath0790.05023WikidataQ127097238 ScholiaQ127097238MaRDI QIDQ688263

Craig W. Rasmussen, J. Richard Lundgren

Publication date: 9 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treesinterval graphcompetition graphstwo-step graph

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (8)

Graph equation for line graphs and \(m\)-step graphs ⋮ Injective coloring of graphs revisited ⋮ Structural properties and hamiltonicity of neighborhood graphs ⋮ A class of acyclic digraphs with interval competition graphs ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ A characterization of graphs with interval two-step graphs ⋮ Chromatic numbers of competition graphs ⋮ The \(m\)-step competition graph of a digraph

Cites Work

• Interval competition graphs of symmetric digraphs
• Inverting graphs of rectangular matrices
• A characterization of competition graphs
• Representation of a finite graph by a set of intervals on the real line
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-step graphs of trees