On characterizing radio \(k\)-coloring problem by path covering problem (Q488288): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034268496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio k-labelings for Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3426085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On radio \((n-4)\)-chromatic number of the path \(P_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal radio labellings of complete \(m\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio number for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Distance Labelings for Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal covering of cacti by vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal number of some powers of cycles / rank
 
Normal rank

Latest revision as of 14:12, 9 July 2024

scientific article
Language Label Description Also known as
English
On characterizing radio \(k\)-coloring problem by path covering problem
scientific article

    Statements

    On characterizing radio \(k\)-coloring problem by path covering problem (English)
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    radio \(k\)-coloring
    0 references
    Hamiltonian path
    0 references
    path covering number
    0 references
    circulant graph
    0 references

    Identifiers