The \(k\)-proper index of graphs (Q1734744): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2016.10.025 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963397244 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.03503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-rainbow index and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the upper bound of the rainbow index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and Algorithms for Rainbow Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-rainbow index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to a conjecture on the rainbow connection number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection with many colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of rainbow connections for planar and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of graphs having large proper connection numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (strong) rainbow connection numbers of Cayley graphs on abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 3-rainbow index \(n-1\) and \(n-2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 4-rainbow index 3 and \(n-1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds for 3-rainbow index of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2016.10.025 / rank
 
Normal rank

Latest revision as of 06:38, 11 December 2024

scientific article
Language Label Description Also known as
English
The \(k\)-proper index of graphs
scientific article

    Statements

    The \(k\)-proper index of graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    coloring of graphs
    0 references
    \(k\)-proper index
    0 references
    characterization of graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references