Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W97094275 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.2306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On island sequences of labelings with a condition at distance two / 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: Q4052166 / 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: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole \(L(2,1)\)-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Color Theorems for L(2,1)-Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on collections of graphs with non-surjective lambda labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Graphs with Non-Surjective <i>L</i>(2,1)-Labelings / 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: Q4050641 / 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: Solving the path cover problem on circular-arc graphs by using an approximation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum path cover of a distance-hereditary graph in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal path cover algorithm for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems on consecutive \(L(2,1)\)-labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem on non-full colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal chain partitions of trees / 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: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path coverings of the vertices of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-partition problem in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Cayley Graphs on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey / rank
 
Normal rank

Latest revision as of 11:03, 8 July 2024

scientific article
Language Label Description Also known as
English
Path covering number and \(L(2,1)\)-labeling number of graphs
scientific article

    Statements

    Path covering number and \(L(2,1)\)-labeling number of graphs (English)
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    \(L(2, 1)\)-labeling
    0 references
    path covering number
    0 references
    hole index
    0 references
    0 references
    0 references

    Identifiers