Pages that link to "Item:Q2368934"
From MaRDI portal
The following pages link to On trees with a maximum proper partial 0-1 coloring containing a maximum matching (Q2368934):
Displaying 10 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- On edge-disjoint pairs of matchings (Q998470) (← links)
- Characterization of a class of graphs related to pairs of disjoint matchings (Q1011703) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
