Words and Graphs (Record no. 51765)

000 -LEADER
fixed length control field 03223nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-3-319-25859-1
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200420220219.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151118s2015 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319258591
-- 978-3-319-25859-1
082 04 - CLASSIFICATION NUMBER
Call Number 004.0151
100 1# - AUTHOR NAME
Author Kitaev, Sergey.
245 10 - TITLE STATEMENT
Title Words and Graphs
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVIII, 264 p. 137 illus. in color.
490 1# - SERIES STATEMENT
Series statement Monographs in Theoretical Computer Science. An EATCS Series,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- 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 ## - SUMMARY, ETC.
Summary, etc This 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 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Lozin, Vadim.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-319-25859-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2015.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computers.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algebra.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algebra.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1431-2654
912 ## -
-- ZDB-2-SCS

No items available.