Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 2154968 - MaRDI portal

scientific article; zbMATH DE number 2154968

From MaRDI portal
Publication:4665539

zbMath1066.05125MaRDI QIDQ4665539

David Erwin, Ping Zhang, Gary Chartrand

Publication date: 11 April 2005


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (35)

Radio and radial radio numbers of certain sunflower extended graphsRadio-\(k\)-labeling of cycles for large \(k\)On the radio number of square of graphsRadio numbers of some caterpillarsHole: An Emerging Character in the Story of Radio k-Coloring ProblemFurther results on the radio number of treesAntipodal number of some powers of cyclesA linear algorithm for radio \(k\)-coloring powers of paths having small diameterRadio number for the Cartesian product of two treesGreedy \(F\)-colorings of graphsRadio number of treesUnnamed ItemA new graph radio k-coloring algorithmRadio number of treesImproved lower bounds for the radio number of treesOptimal radio-\(k\)-labelings of treesTriameter of graphsOn characterizing radio \(k\)-coloring problem by path covering problemA lower bound for radio \(k\)-chromatic numberOptimal radio labellings of block graphs and line graphs of treesAntipodal number of full \(m\)-ary treesRadial radio number of hexagonal and its derived networksUpper bound for radio -chromatic number of graphs in connection with partition of vertex setRadio number for treesA lower bound technique for radio \(k\)-coloringRadio $k$-labeling of pathsImproved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)Optimal radio labellings of complete \(m\)-ary treesHamiltonian colorings of graphsOn labeling the vertices of products of complete graphs with distance constraintsA new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic numberOn Hamiltonian colorings of graphsRadio numbers of certain \(m\)-distant treesAntipodal radio labelling of full binary treesRadio fuzzy graphs and assignment of frequency in radio stations







This page was built for publication: