NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS

@article{1701400,
      author = {San San Tint, Khaing Khaing Soe Wai},
      title = {NONSEPARABLE COMPONENTS, CHORDALITY AND 2-FACTORS IN TOUGH GRAPHS},
      journal = {Iconic Research And Engineering Journals},
      year = {2019},
      volume = {3},
      number = {1},
      pages = {289-294},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1701400.pdf},
      abstract = {In this paper we mention no separable components of longest cycles. And then we establish cordiality and 2-factor in tough graph. A graph G is chordal if it contains no cordless cycle of length at least four and is k-chordal if a longest cordless cycle in G has length at most k. Finally the result reveals that all 3/2-tough 5-chordal graph G with a 2-factor are obtained},
      keywords = {no separable components, 2-factor, induced sub graph, toughness, maximum degree, minimum degree, longest cycle, chordal graph, Tutte pair
},
      month = {July},
  }