Two-step graphs of trees
From MaRDI portal
Publication:688263
DOI10.1016/0012-365X(93)90122-AzbMATH Open0790.05023WikidataQ127097238 ScholiaQ127097238MaRDI QIDQ688263FDOQ688263
Craig Rasmussen, J. Richard Lundgren
Publication date: 9 June 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A characterization of competition graphs
- Representation of a finite graph by a set of intervals on the real line
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval competition graphs of symmetric digraphs
- Inverting graphs of rectangular matrices
Cited In (12)
- Graph equation for line graphs and \(m\)-step graphs
- Connected triangle-free \(m\)-step competition graphs
- On the trees whose 2-step competition numbers are two.
- A class of acyclic digraphs with interval competition graphs
- A characterization of graphs with interval two-step graphs
- The \(m\)-step competition graph of a digraph
- Structural properties and hamiltonicity of neighborhood graphs
- Graphs with at most two trees in a forest-building process
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic numbers of competition graphs
- Injective coloring of graphs revisited
This page was built for publication: Two-step graphs of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688263)
