On k-pairable regular graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- Bipartite diametrical graphs of diameter 4 and extreme orders
- Cross-cloning and antipodal graphs
- Even graphs
- Graph multiplication
- Graph theory
- Matching theory
- New Tricks for Old Trees: Maps and the Pigeonhole Principle
- On \(k\)-pairable graphs
- On k-pairable graphs from trees
- Pair lengths of product graphs
- Retract rigid Cartesian products of graphs
- Uniquely pairable graphs
Cited in
(9)- scientific article; zbMATH DE number 4047778 (Why is no real title available?)
- Uniquely pairable graphs
- scientific article; zbMATH DE number 4187869 (Why is no real title available?)
- On \(k\)-pairable graphs
- scientific article; zbMATH DE number 3849268 (Why is no real title available?)
- Minimum order of \(r\)-regular bipartite graphs of pair length \(k\)
- Sharp bounds on the size of pairable graphs and pairable bipartite graphs
- On k-pairable graphs from trees
- Three-regular path pairable graphs
This page was built for publication: On \(k\)-pairable regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712262)