scientific article
From MaRDI portal
Publication:3322121
zbMath0537.05023MaRDI QIDQ3322121
Margaret B. Cozzens, Fred S. Roberts
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Asymptotic clique covering ratios of distance graphs ⋮ Chromatic scheduling and frequency assignment ⋮ On Graceful Directed Graphs ⋮ An Asymptotic Approach to the Channel Assignment Problem ⋮ The channel assignment problem for mutually adjacent sites ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ The edge span of T-coloring on graph \(C^{d}_{n}\) ⋮ \(T\)-coloring of certain networks ⋮ T-Coloring of product graphs ⋮ \(T\)-graphs and the channel assignment problem ⋮ Bounds for the frequency assignment problem ⋮ Node-graceful graphs ⋮ \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings ⋮ A rainbow about \(T\)-colorings for complete graphs ⋮ On properties of unit interval graphs with a perceptual motivation ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ A rainbow about T-colorings for complete graphs ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ A polynomial algorithm for finding \(T\)-span of generalized cacti ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube ⋮ \(T\)-colorings of graphs ⋮ Interval competition graphs of symmetric digraphs ⋮ No-hole \((r+1)\)-distant colorings ⋮ Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs ⋮ Anti-\(k\)-labeling of graphs ⋮ A characterization of graphs with interval two-step graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Interference patterns in bijective colorings of 2-regular graphs ⋮ On lower bounds for numbered complete graphs ⋮ Double Semiorders and Double Indifference Graphs ⋮ A characterization of competition graphs of arbitrary digraphs ⋮ The competition number of a graph having exactly one hole ⋮ List \(T\)-colorings of graphs ⋮ No-hole 2-distant colorings ⋮ SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
This page was built for publication:
