On the Colin de Verdière numbers of Cartesian graph products
From MaRDI portal
(Redirected from Publication:1039738)
Recommendations
- On the Colin de Verdière number of graphs
- The Colin de Verdière number and graphs of polytopes
- The Colin de Verdière number and joins of graphs
- Hadwiger number and the Cartesian product of graphs
- scientific article; zbMATH DE number 739124
- On the total domination number of Cartesian products of graphs
- On domatic and total domatic numbers of Cartesian products of graphs
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- The distinguishing number of Cartesian products of complete graphs
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1303522 (Why is no real title available?)
- scientific article; zbMATH DE number 475583 (Why is no real title available?)
- scientific article; zbMATH DE number 637070 (Why is no real title available?)
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Recognizing Cartesian products in linear time
- Sachs' linkless embedding conjecture
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
Cited in
(6)- On the Colin de Verdière number of graphs
- Clique minors in Cartesian products of graphs
- A reduction procedure for the Colin de Verdière number of a graph
- The Colin de Verdière number and graphs of polytopes
- The Colin de Verdière number and sphere representations of a graph
- The Colin de Verdière number and joins of graphs
This page was built for publication: On the Colin de Verdière numbers of Cartesian graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039738)