The following pages link to Hanna Furmańczyk (Q298965):
Displaying 36 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)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Partially normal 5-edge-colorings of cubic graphs (Q2033935) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
- Equitable improper choosability of graphs (Q2205938) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- \(r\)-Dynamic chromatic number of some line graphs (Q2322985) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- For which graphs the sages can guess correctly the color of at least one hat (Q2632547) (← links)
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784) (← links)
- (Q2858945) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- (Q5033103) (← links)
- Equitable d-degenerate Choosability of Graphs (Q5041194) (← links)
- Equitable list vertex colourability and arboricity of grids (Q5086846) (← links)
- Equitable coloring of Kneser graphs (Q5324107) (← links)
- (Q5443776) (← links)
- (Q5476406) (← 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)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)
- Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)
