On word colourings and some perfect graphs

AL. A. MARKOV; T. G. SMIRNOVA

doi:10.1515/dma.1992.2.1.25

Home Mathematics On word colourings and some perfect graphs

Article

Licensed

Unlicensed Requires Authentication

On word colourings and some perfect graphs

AL. A. MARKOV and T. G. SMIRNOVA

Published/Copyright: October 9, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 2 Issue 1

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

MARKOV, AL. A. and SMIRNOVA, T. G.. "On word colourings and some perfect graphs" Discrete Mathematics and Applications, vol. 2, no. 1, 1992, pp. 25-44. https://doi.org/10.1515/dma.1992.2.1.25

MARKOV, A. & SMIRNOVA, T. (1992). On word colourings and some perfect graphs. Discrete Mathematics and Applications, 2(1), 25-44. https://doi.org/10.1515/dma.1992.2.1.25

MARKOV, A. and SMIRNOVA, T. (1992) On word colourings and some perfect graphs. Discrete Mathematics and Applications, Vol. 2 (Issue 1), pp. 25-44. https://doi.org/10.1515/dma.1992.2.1.25

MARKOV, AL. A. and SMIRNOVA, T. G.. "On word colourings and some perfect graphs" Discrete Mathematics and Applications 2, no. 1 (1992): 25-44. https://doi.org/10.1515/dma.1992.2.1.25

MARKOV A, SMIRNOVA T. On word colourings and some perfect graphs. Discrete Mathematics and Applications. 1992;2(1): 25-44. https://doi.org/10.1515/dma.1992.2.1.25

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1992

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

On the edge-independence number and edge-covering number for regular graphs
Systems of antiprefix equations in words
On word colourings and some perfect graphs
Optimal search of extremums of convex functions on lattices
The completeness modulo ideal in functional systems of a program type
On the solution of systems of automaton equations
Some conditional distributions for random graphs
Randomized decomposable statistics in the scheme of independent allocating particles into boxes
On the number of cycles in a random non-equiprobable graph

Search journal Search the content of this journal

https://doi.org/10.1515/dma.1992.2.1.25

Articles in the same Issue

On the edge-independence number and edge-covering number for regular graphs
Systems of antiprefix equations in words
On word colourings and some perfect graphs
Optimal search of extremums of convex functions on lattices
The completeness modulo ideal in functional systems of a program type
On the solution of systems of automaton equations
Some conditional distributions for random graphs
Randomized decomposable statistics in the scheme of independent allocating particles into boxes
On the number of cycles in a random non-equiprobable graph