Pages that link to "Item:Q2562796"
From MaRDI portal
The following pages link to Characterization of n-path graphs and of graphs having \(n\)-th root (Q2562796):
Displayed 13 items.
- Nonnegative square roots of matrices (Q269294) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- A characterization of competition graphs (Q1055443) (← links)
- Switching invariant two-path signed graphs (Q1076698) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- The \(m\)-step competition graph of a digraph (Q1582072) (← links)
- Connected triangle-free \(m\)-step competition graphs (Q1765515) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Iterated open neighborhood graphs and generalizations (Q2446342) (← links)
- A bibliography of graph equations (Q3856811) (← links)
- Negation switching invariant 3-Path signed graphs (Q5069923) (← links)
- Spectral analysis of <i>t</i>-path signed graphs (Q5227947) (← links)