Total monochromatic connection of graphs (Q2374173): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831023
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963358655 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.03241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of almost all graphs and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results on the colorful monochromatic vertex-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful monochromatic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the colorful monochromatic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow vertex \(k\)-connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total rainbow \(k\)-connection in graphs / rank
 
Normal rank

Latest revision as of 03:50, 13 July 2024

scientific article
Language Label Description Also known as
English
Total monochromatic connection of graphs
scientific article

    Statements

    Total monochromatic connection of graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    0 references
    total-colored graph
    0 references
    total monochromatic connection
    0 references
    spanning tree with maximum number of leaves
    0 references
    0 references
    0 references