Pages that link to "Item:Q941380"
From MaRDI portal
The following pages link to On covering vertices of a graph by trees (Q941380):
Displaying 14 items.
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Covering the edges of a graph by a prescribed tree with minimum overlap (Q1386432) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- On the tree cover number of a graph (Q2357664) (← links)
- (Q3169852) (← links)
- (Q3369845) (← links)
- (Q3584203) (← links)
- (Q4014421) (← links)
- (Q4526640) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900919) (← links)