A short update on equipackable graphs

DOI10.1016/J.DISC.2006.11.028zbMATH Open1130.05049OpenAlexW2087894368MaRDI QIDQ2467992FDOQ2467992

Preben Dahl Vestergaard

Publication date: 30 January 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://vbn.aau.dk/ws/files/6815284/R-2007-06.pdf

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

zbMATH Keywords

decompositionpackingpathrandomly decomposablerandomly packable

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• Random packings of graphs
• Title not available (Why is that?)
• Randomly matchable graphs
• Title not available (Why is that?)
• Equipackable graphs
• Randomly decomposable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Totally equimatchable graphs
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• 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
• P4-equicoverable graphs which contain cycles with length at least 4
• 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)