scientific article; zbMATH DE number 1161337
From MaRDI portal
Publication:4393335
Recommendations
- scientific article; zbMATH DE number 5370876
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- scientific article; zbMATH DE number 1932300
- A sufficient condition for a graph to have a k-tree
- A characterization of (_t,_2)-trees
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- On the (2,2)-domination number of trees
- A sufficient degree condition for a graph to contain all trees of size k
- A characterization of trees with equal 2-domination and 2-independence numbers
Cited in
(10)- The \(m\)-step competition graph of a digraph
- Connected triangle-free \(m\)-step competition graphs
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- On the trees whose 2-step competition numbers are two.
- scientific article; zbMATH DE number 19211 (Why is no real title available?)
- scientific article; zbMATH DE number 1558366 (Why is no real title available?)
- scientific article; zbMATH DE number 1932300 (Why is no real title available?)
- scientific article; zbMATH DE number 4187826 (Why is no real title available?)
- Two-step graphs of trees
- Characterizing paths as \(m\)-step competition graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393335)
