scientific article; zbMATH DE number 3853101

zbMATH Open0537.05023MaRDI QIDQ3322121FDOQ3322121

Authors: M. Cozzens, Fred Roberts 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• \(T\)-colorings of graphs: recent results and open problems
• scientific article; zbMATH DE number 3873389
• \(T\)-graphs and the channel assignment problem
• \(T\)-colorings and \(T\)-edge spans of graphs
• Distance graphs and the \(T\)-coloring problem

zbMATH Keywords

T-coloringradio frequency assignment problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (46)

• A rainbow about \(T\)-colorings for complete graphs
• Interval competition graphs of symmetric digraphs
• No-hole \((r+1)\)-distant colorings
• Title not available (Why is that?)
• Asymptotic clique covering ratios of distance graphs
• Double Semiorders and Double Indifference Graphs
• Node-graceful graphs
• Title not available (Why is that?)
• \(T\)-colorings, divisibility and the circular chromatic number
• No-hole 2-distant colorings
• Title not available (Why is that?)
• The edge span of T-coloring on graph \(C^{d}_{n}\)
• On Graceful Directed Graphs
• SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Optimal channel assignment with list-edge coloring
• Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
• An Asymptotic Approach to the Channel Assignment Problem
• Graph covers using \(t\)-colourable vertex sets.
• \(T\)-colorings of graphs: recent results and open problems
• Bounds for the frequency assignment problem
• Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs
• On lower bounds for numbered complete graphs
• A polynomial algorithm for finding \(T\)-span of generalized cacti
• Anti-\(k\)-labeling of graphs
• Further Results on T-Coloring and Frequency Assignment Problems
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• Chromatic scheduling and frequency assignment
• \(T\)-graphs and the channel assignment problem
• Channel assignment problem and relaxed 2-distant coloring of graphs
• The competition number of a graph having exactly one hole
• The complexity of the \(T\)-coloring problem for graphs with small degree
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• Title not available (Why is that?)
• A characterization of graphs with interval two-step graphs
• \(T\)-coloring of product graphs
• \(T\)-coloring of certain networks
• The channel assignment problem for mutually adjacent sites
• \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
• A rainbow about T-colorings for complete graphs
• Interference patterns in bijective colorings of 2-regular graphs
• \(T\)-colorings of graphs
• List \(T\)-colorings of graphs
• On properties of unit interval graphs with a perceptual motivation
• A characterization of competition graphs of arbitrary digraphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322121)