On the number of increasing paths in labeled cycles and stars

DOI10.1007/S11766-007-0001-3zbMATH Open1125.05055OpenAlexW2028027493MaRDI QIDQ2463992FDOQ2463992

Authors: Lei Chen, Yongsheng Ye, Changhong Lu 

Publication date: 7 December 2007

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-007-0001-3

Recommendations

• Increasing paths in countable graphs
• scientific article; zbMATH DE number 279643
• On size multipartite Ramsey numbers for stars versus paths and cycles
• Publication:4945873
• The star chromatic number of general Mycielski graphs of paths and cycles
• On the star total chromatic number of Mycielski graphs of path and cycle
• scientific article; zbMATH DE number 3952817
• On the number of paths and cycles for almost all graphs and digraphs
• On a combinatorial problem on the star graphs
• scientific article; zbMATH DE number 90572

zbMATH Keywords

cyclepathlabeled graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• \(E_{11}\) and M theory
• A solution to a problem of Gargano, Lewinter and Malerba

Cited In (4)

• Increasing paths in countable graphs
• The \(\mu\)-permanent, a new graph labeling, and a known integer sequence
• A solution to a problem of Gargano, Lewinter and Malerba
• Tree-optimized labeled directed graphs

This page was built for publication: On the number of increasing paths in labeled cycles and stars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463992)