<?xml version="1.0" encoding="UTF-8"?>
<xml><bibliography><APA>Thidarat Nimnuch และ Khajee Jantarakhajorn. (2013) Characterization of the Minimizing Graphs with n Vertices and k Cut Edges where 4 less-than n less-than 12 and 1 less-than k less-than n/2. &lt;i&gt;Thai Journal of Science and Technology&lt;/i&gt;, &lt;i&gt;2&lt;/i&gt;(3), 237-242.</APA><Chicago>Thidarat Nimnuch และ Khajee Jantarakhajorn. "Characterization of the Minimizing Graphs with n Vertices and k Cut Edges where 4 less-than n less-than 12 and 1 less-than k less-than n/2". Thai Journal of Science and Technology  2 (2013):237-242.</Chicago><MLA>Thidarat Nimnuch และ Khajee Jantarakhajorn. Characterization of the Minimizing Graphs with n Vertices and k Cut Edges where 4 less-than n less-than 12 and 1 less-than k less-than n/2. Thammasat University:ม.ป.ท. 2013.</MLA></bibliography></xml>
