Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs
From MaRDI portal
Publication:6657246
DOI10.1016/j.dam.2024.10.022MaRDI QIDQ6657246
Wenying Xi, Wensong Lin, Yuquan Lin
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing stars in fullerenes
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Shortest perfect pseudomatchings in fullerene graphs
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- On domination in connected cubic graphs
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
- Factors and factorizations of graphs—a survey
- Packings by Complete Bipartite Graphs
- How many disjoint 2-edge paths must a cubic graph have?
- Paths, Stars and the Number Three
- On star family packing of graphs
- The fullerene graphs with a perfect star packing
- Star Partitions of Perfect Graphs
- Parallel Processing and Applied Mathematics
- Packing 2- and 3-stars into cubic graphs
This page was built for publication: Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs
