Perfect Graphs and its Extensions
Access Status
Fulltext not available
Embargo Lift Date
2027-06-30
Date
2025Supervisor
Guanglu Zhou
Louis Caccetta
Type
Thesis
Award
PhD
Metadata
Show full item recordFaculty
Science and Engineering
School
School of Electrical Engineering, Computing and Mathematical Sciences
Collection
Abstract
This thesis investigates perfect graphs and its extensions, focusing on induced and non-induced star-perfect graphs, as well as strongly-perfect graphs. It presents an alternative proof to Lovász's characterization (1972) and characterizes induced star-perfect graphs in terms of minimal forbidden induced subgraphs. The thesis also identifies classes of non-induced star-perfect graphs and formulates its invariants using integer-programming. Additionally, a new list of sp-critical graphs and a sufficient condition for a graph to be strongly-perfect is presented.
Related items
Showing items related by title, author, creator and subject.
-
Ananchuen, Nawarat (1994)Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is said to be k-extendable if for every matching M of size k in G there is a perfect matching in G containing all the edges ...
-
Ananchuen, N.; Ruangthampisan, S.; Ananchuen, W.; Caccetta, Louis (2018)© 2018, University of Queensland. All rights reserved. Let ? i (G) denote the independent domination number of G. A graph G is said to be k-? i -vertex-critical if ? i (G) = k and for each x ? V (G), ? i (G - x) < k. ...
-
Achuthan, Nirmala; Achuthan, Narasimaha; Simanihuruk, M. (2011)A graph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced on vertices receiving the same colour is at most k. The k-defective chromatic number Xk(G) ...