Skip to main content
×
×
Home

A note on the conditional chromatic polynomial

  • V. Voloshin (a1)
Extract

In this note we consider a finite graph without loops and multiple edges. The colouring of a graph G in λ colours is the colouring of its vertices in such a way that no two of adjacent vertices have the same colours and the number of used colours does not exceed λ [1, 4]. Two colourings of graph G are called different if there exists at least one vertex which changes colour when passing from one colouring to another.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A note on the conditional chromatic polynomial
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A note on the conditional chromatic polynomial
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A note on the conditional chromatic polynomial
      Available formats
      ×
Copyright
References
Hide All
1.Berge, C.. Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
2.Voloshin, V.. Conditional chromatic polynomial. In Research on applied mathematics and informatics, Kishinev, Science, 1990, 1619(in Russian).
3.Voloshin, V.. Conditional chromatic polynomial. In Methods and programs of resolving of optimization problems on graphs and networks. Part 1. Theses of reports (Novosibirsk, 1989 (in Russian)).
4.Zykov, A.. Fundamentals of graph theory (BCS Associates, Moscow, and Idaho USA, 1990).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Glasgow Mathematical Journal
  • ISSN: 0017-0895
  • EISSN: 1469-509X
  • URL: /core/journals/glasgow-mathematical-journal
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 58 *
Loading metrics...

Abstract views

Total abstract views: 33 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 13th June 2018. This data will be updated every 24 hours.