Pages that link to "Item:Q1264277"
From MaRDI portal
The following pages link to On-line coloring \(k\)-colorable graphs (Q1264277):
Displaying 38 items.
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Graph coloring in linear time (Q921012) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- Online coloring graphs with high girth and high odd girth (Q974990) (← links)
- Online hypergraph coloring (Q975516) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
- Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Online independent sets. (Q1853575) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Online coloring a token graph (Q2303438) (← links)
- On-line list colouring of graphs (Q2380291) (← links)
- Online coloring co-interval graphs (Q2380735) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- (Q4010319) (← links)
- Randomized online graph coloring (Q4015271) (← links)
- (Q4249728) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- Online hypergraph coloring with rejection (Q5501518) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)