Packing 2- and 3-stars into cubic graphs
From MaRDI portal
Publication:6095048
DOI10.1016/j.amc.2023.128287MaRDI QIDQ6095048
Wenying Xi, Wensong Lin, Yuquan Lin
Publication date: 11 October 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Packings by cliques and by finite families of graphs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- The path partition problem and related problems in bipartite graphs
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
- On the Complexity of General Graph Factor Problems
- Path factors in cubic graphs
- Factors and factorizations of graphs—a survey
- Packings by Complete Bipartite Graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- How many disjoint 2-edge paths must a cubic graph have?
- On star family packing of graphs
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Parallel Processing and Applied Mathematics
