Recommendations
- Equipackable graphs
- A note on the equitable covering and equitable packing of a graph
- Some results on packing graphs in their complements
- \(M_{2}\)-equipackable graphs
- Compact graphs and equitable partitions
- Packing graphs in their complements
- Publication:4940073
- Further results on packing related parameters in graphs
- Packings in complete graphs
- More on limited packings in graphs
Cites work
- scientific article; zbMATH DE number 4134097 (Why is no real title available?)
- scientific article; zbMATH DE number 3873377 (Why is no real title available?)
- scientific article; zbMATH DE number 3710196 (Why is no real title available?)
- scientific article; zbMATH DE number 47528 (Why is no real title available?)
- scientific article; zbMATH DE number 1933236 (Why is no real title available?)
- scientific article; zbMATH DE number 2065937 (Why is no real title available?)
- scientific article; zbMATH DE number 1743980 (Why is no real title available?)
- Equipackable graphs
- Matching theory
- Random packings of graphs
- Randomly decomposable graphs
- Randomly matchable graphs
- Totally equimatchable graphs
Cited in
(9)- \({P_5}\)-equipackable special graphs
- scientific article; zbMATH DE number 1185608 (Why is no real title available?)
- \(P_4\)-equicoverable graphs which contain cycles with length at least 4
- scientific article; zbMATH DE number 1409232 (Why is no real title available?)
- All \(P_{3}\)-equipackable graphs
- All \(M_{2}\)-equicoverable graphs
- \(M_{2}\)-equipackable graphs
- Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges
- Equipackable graphs
This page was built for publication: A short update on equipackable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467992)
