Abstract
The first use of graph theory is dated to 1735. Swiss mathematician and physicist, Leonhard Euler, formulated theorems and definitions related to graphs. Euler was inspired by a real problem regarding crossing bridges in Konigsberg (east Prussia, also known as Krolewiec, Kaliningrad). He tried to take a walk around the city in such a way that each of the seven bridges was crossed only once. Finally, Euler proved that it was impossible, simultaneously solving the puzzles with the application of graph theory. Nowadays, such a theory is used in numerous fields of science and practical approaches. This chapter presents notations and definitions related to the graph theory. Furthermore, perfect graphs and comparability graphs are introduced. New theorems, lemmas, and algorithms regarding recognition and coloring of comparability graphs are proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
