Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph

    Access Status
    Fulltext not available
    Authors
    Achuthan, Nirmala
    Achuthan, Narasimaha
    Simanihuruk, M.
    Date
    2011
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Achuthan, Nirmala and Achuthan, N.R. and Simanihuruk, M. 2011. The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph. The Australasian Journal of Combinatorics. 49: pp. 3-13.
    Source Title
    The Australasian Journal of Combinatorics
    ISSN
    1034-4942
    School
    Department of Mathematics and Statistics
    URI
    http://hdl.handle.net/20.500.11937/11944
    Collection
    • Curtin Research Publications
    Abstract

    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) of a graph G is the least positive integer m for which G is (m, k)-colourable. The Nordhaus-Gaddum problem is to find sharp bounds for Xk(G)+Xk(G) and Xk(G). Xk(G) over the set of all graphs of order p where G is the complement of the graph G. In this paper we obtain a sharp upper bound for Xk(G)+Xk(G), where G is a P4-free graph of order p and k = 1 or 2.

    Related items

    Showing items related by title, author, creator and subject.

    • On minimal triangle-free graphs with prescribed k-defective chromatic number
      Achuthan, Nirmala; Achuthan, Narasimaha; Simanihuruk, M. (2011)
      A graph G is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of any subgraph induced on vertices receiving the same colour is at most k. The k-defective chromatic number χk(G) ...
    • Graphs that are critical with respect to matching extension and diameter
      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 ...
    • Graphs with prescribed adjacency properties
      Ananchuen, Watcharaphong (1993)
      A graph G is said to have property P(m,n,k) if for any set of m + n distinct vertices there are at least k other vertices, each of which is adjacent to the first m vertices but not adjacent to any of the latter n vertices. ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.