The following pages link to (Q3322121):
Displaying 38 items.
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube (Q489710) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
- A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
- Node-graceful graphs (Q1104944) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- \(T\)-colorings of graphs (Q1197028) (← links)
- On lower bounds for numbered complete graphs (Q1293201) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- No-hole 2-distant colorings (Q1310246) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
- \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- On properties of unit interval graphs with a perceptual motivation (Q1377473) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- Interference patterns in bijective colorings of 2-regular graphs (Q1566572) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs (Q1653937) (← links)
- A characterization of graphs with interval two-step graphs (Q1805321) (← links)
- No-hole \(k\)-tuple \((r+1)\)-distant colorings (Q1917240) (← links)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← links)
- Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs (Q2030247) (← links)
- \(T\)-colorings, divisibility and the circular chromatic number (Q2227106) (← links)
- Anti-\(k\)-labeling of graphs (Q2286097) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- The competition number of a graph having exactly one hole (Q2576849) (← links)
- \(T\)-coloring of certain networks (Q2630781) (← links)
- Double Semiorders and Double Indifference Graphs (Q3669466) (← links)
- On Graceful Directed Graphs (Q3701444) (← links)
- An Asymptotic Approach to the Channel Assignment Problem (Q3701467) (← links)
- <i>T</i>-Coloring of product graphs (Q5063281) (← links)
- SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS (Q5865377) (← links)
