Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2019, Volume 16, Pages 1703–1715
DOI: https://doi.org/10.33048/semi.2019.16.120 (Mi semr1161) 		 
Discrete mathematics and mathematical cybernetics

On garlands in $\chi$-uniquely colorable graphs

P. A. Gein

Ural Federal University, 51, Lenina ave., Ekaterinburg, 62083, Russia
Full-text PDF (552 kB)
References:
PDF
HTML
DOI: https://doi.org/10.33048/semi.2019.16.120
Abstract: A graph $G$ is called $\chi$-uniquely colorable, if all its $\chi$-colorings induce the same partion of the vertex set into one-color components. For $\chi$-uniquely colorable graphs new bound of the number of vertex set partions into $\chi + 1$ cocliques is found.
Keywords: graph, complete multipartite graph, uniquely colorable graph, chromatic uniqueness, chromatic invartiant.
Received August 9, 2019, published November 21, 2019
Bibliographic databases:
Document Type: Article
UDC: 519.174
MSC: 05C15
Language: English
Citation: P. A. Gein, “On garlands in $\chi$-uniquely colorable graphs”, Sib. Èlektron. Mat. Izv., 16 (2019), 1703–1715
Citation in format AMSBIB
\Bibitem{Gei19}
\by P.~A.~Gein
\paper On garlands in $\chi$-uniquely colorable graphs
\jour Sib. \`Elektron. Mat. Izv.
\yr 2019
\vol 16
\pages 1703--1715
\mathnet{http://mi.mathnet.ru/semr1161}
\crossref{https://doi.org/10.33048/semi.2019.16.120}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000497717700004}
Linking options:
  • https://www.mathnet.ru/eng/semr1161
  • https://www.mathnet.ru/eng/semr/v16/p1703
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:175
    Full-text PDF :127
    References:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024