The following pages link to On matching cover of graphs (Q463743):
Displaying 10 items.
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration (Q1733738) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- Equivalence classes in matching covered graphs (Q2185935) (← links)
- Equitable partitions into matchings and coverings in mixed graphs (Q2237227) (← links)
- A note on minimal matching covered graphs (Q2368933) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← links)
- (Q3517952) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)