All P₃-equipackable graphs
From MaRDI portal
Publication:960935
A connected graph \(G\) is called equipackable if \textit{any} sequence of removals of two adjacent edges terminates with the empty graph (if \(G\) has an even number of edges) or with a single edge (if \(G\) has an odd number of edges). This paper characterizes all equipackable graphs.
Recommendations
Cites work
- \(M_{2}\)-equipackable graphs
- A short update on equipackable graphs
- Equipackable graphs
- 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 1743980 (Why is no real title available?)
- Random packings of graphs
- Randomly decomposable graphs
Cited in
(7)- Pack graphs with subgraphs of size three
- All \(M_{2}\)-equicoverable graphs
- \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
- \({P_5}\)-equipackable special graphs
- P₄-equicoverable graphs which contain cycles with length at least 4
- Characterization of P₃ P₂-equipackable graphs with 3m (m 1) edges
- Randomly \(P_k\)-decomposable graphs
This page was built for publication: All \(P_{3}\)-equipackable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960935)
