scientific article; zbMATH DE number 3853101
From MaRDI portal
Publication:3322121
Recommendations
Cited in
(46)- A rainbow about T-colorings for complete graphs
- Interval competition graphs of symmetric digraphs
- No-hole (r+1)-distant colorings
- scientific article; zbMATH DE number 1163304 (Why is no real title available?)
- Asymptotic clique covering ratios of distance graphs
- Node-graceful graphs
- Double Semiorders and Double Indifference Graphs
- scientific article; zbMATH DE number 1944137 (Why is no real title available?)
- \(T\)-colorings, divisibility and the circular chromatic number
- No-hole 2-distant colorings
- The edge span of T-coloring on graph \(C^{d}_{n}\)
- scientific article; zbMATH DE number 1990724 (Why is no real title available?)
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- On Graceful Directed Graphs
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
- Optimal channel assignment with list-edge coloring
- SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
- Graph covers using \(t\)-colourable vertex sets.
- An Asymptotic Approach to the Channel Assignment Problem
- \(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
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- Further Results on T-Coloring and Frequency Assignment Problems
- 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
- scientific article; zbMATH DE number 3873389 (Why is no real title available?)
- A characterization of graphs with interval two-step graphs
- The channel assignment problem for mutually adjacent sites
- \(T\)-coloring of certain networks
- \(T\)-coloring of product graphs
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
- Interference patterns in bijective colorings of 2-regular graphs
- A rainbow about T-colorings for complete 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)
