000 03223nam a22005295i 4500
001 978-3-319-25859-1
003 DE-He213
005 20200420220219.0
007 cr nn 008mamaa
008 151118s2015 gw | s |||| 0|eng d
020 _a9783319258591
_9978-3-319-25859-1
024 7 _a10.1007/978-3-319-25859-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aKitaev, Sergey.
_eauthor.
245 1 0 _aWords and Graphs
_h[electronic resource] /
_cby Sergey Kitaev, Vadim Lozin.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXVIII, 264 p. 137 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
505 0 _aIntroduction -- Hereditary Classes of Graphs -- What Word-Representable Graphs Are and Where They Come From -- Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations -- Various Results on Word-Representable Graphs -- Open Problems and Further Research Directions on Word-Representable Graphs -- Interrelations Between Words and Graphs in the Literature -- More on Interrelations Between Words and Graphs in the Literature -- App. A: Graph Theory Background -- App. B: Beyond Graph Theory Background.
520 _aThis is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics. After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability. The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra. .
650 0 _aComputer science.
650 0 _aComputers.
650 0 _aComputer science
_xMathematics.
650 0 _aAlgebra.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
650 2 4 _aAlgebra.
700 1 _aLozin, Vadim.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319258577
830 0 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-25859-1
912 _aZDB-2-SCS
942 _cEBK
999 _c51765
_d51765