Pages that link to "Item:Q1823255"
From MaRDI portal
The following pages link to The subchromatic number of a graph (Q1823255):
Displaying 27 items.
- The equivalence number of a line graph (Q350825) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Coloring complexes and combinatorial Hopf monoids (Q2102693) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- (Q5708621) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
