The following pages link to (Q3220612):
Displaying 37 items.
- Co-2-plex vertex partitions (Q498448) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- Local coloring of Kneser graphs (Q998322) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Interpolation theorems for graphs, hypergraphs and matroids (Q1584241) (← links)
- Adjacent strong edge coloring of graphs (Q1609524) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- On path-chromatically unique graphs (Q1916374) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Computing Wiener and hyper-Wiener indices of zero-divisor graph of \(\mathbb{Z}_{g^3}\times\mathbb{Z}_{\mathfrak{I}_1\mathfrak{I}_2}\) (Q2086458) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Conditional colorings of graphs (Q2501581) (← links)
- The t-improper chromatic number of random graphs (Q3503499) (← links)
- Conditional chromatic number and graph operations (Q3984024) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- Interpolation theorems for a family of spanning subgraphs (Q4700044) (← links)
- Harary polynomials (Q5056203) (← links)
- Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
