Two-step graphs of trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4139769 (Why is no real title available?)
- scientific article; zbMATH DE number 3912431 (Why is no real title available?)
- scientific article; zbMATH DE number 4025487 (Why is no real title available?)
- scientific article; zbMATH DE number 4070952 (Why is no real title available?)
- scientific article; zbMATH DE number 3679862 (Why is no real title available?)
- scientific article; zbMATH DE number 15260 (Why is no real title available?)
- scientific article; zbMATH DE number 975363 (Why is no real title available?)
- A characterization of competition graphs
- Interval competition graphs of symmetric digraphs
- Inverting graphs of rectangular matrices
- Representation of a finite graph by a set of intervals on the real line
Cited in
(12)- Chromatic numbers of competition graphs
- A characterization of graphs with interval two-step graphs
- On the trees whose 2-step competition numbers are two.
- Injective coloring of graphs revisited
- Graphs with at most two trees in a forest-building process
- Graph equation for line graphs and \(m\)-step graphs
- A class of acyclic digraphs with interval competition graphs
- Connected triangle-free \(m\)-step competition graphs
- The \(m\)-step competition graph of a digraph
- Structural properties and hamiltonicity of neighborhood graphs
- scientific article; zbMATH DE number 4025487 (Why is no real title available?)
- scientific article; zbMATH DE number 125494 (Why is no real title available?)
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)