635 research outputs found

    THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References

    Get PDF
    and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a

    Revisiting path-type covering and partitioning problems

    Get PDF
    This is a survey article which is at the initial stage. The author will appreciate to receive your comments and contributions to improve the quality of the article. The author's contact address is [email protected] problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering problem), covering the vertex set by independent sets (coloring problem), and covering the vertex set by paths or cycles. A similar concept which is partitioning problem is also equally important. Lately research in graph theory has produced unprecedented growth because of its various application in engineering and science. The covering and partitioning problem by paths itself have produced a sizable volume of literatures. The research on these problems is expanding in multiple directions and the volume of research papers is exploding. It is the time to simplify and unify the literature on different types of the covering and partitioning problems. The problems considered in this article are path cover problem, induced path cover problem, isometric path cover problem, path partition problem, induced path partition problem and isometric path partition problem. The objective of this article is to summarize the recent developments on these problems, classify their literatures and correlate the inter-relationship among the related concepts

    Connected factors in graphs - a survey

    Get PDF
    • …
    corecore