The following pages link to Hanna Furmańczyk (Q298965):
Displaying 10 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Altitude of wheels and wheel-like graphs (Q707998) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs (Q6507510) (← links)
- Block graphs - some general results and their equitable colorings (Q6520840) (← links)
