The following pages link to Piotr Borowiecki (Q279200):
Displaying 21 items.
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Graph classes generated by Mycielskians (Q2194538) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
- Dynamic coloring of graphs (Q2883161) (← links)
- On extremal sizes of locally k-tree graphs (Q3073497) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- Parity vertex colouring of graphs (Q3171425) (← links)
- P-bipartitions of minor hereditary properties (Q4209935) (← links)
- Partitions of some planar graphs into two linear forests (Q4209936) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- The potential of greed for independence (Q4650180) (← links)
- On-line P-coloring of graphs (Q5437222) (← links)
- (Q5747397) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
