語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Words and graphs[electronic resource] /
~
Kitaev, Sergey.
Words and graphs[electronic resource] /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
杜威分類號:
511.5
書名/作者:
Words and graphs/ by Sergey Kitaev, Vadim Lozin.
作者:
Kitaev, Sergey.
其他作者:
Lozin, Vadim.
出版者:
Cham : : Springer International Publishing :, 2015.
面頁冊數:
xviii, 264 p. : : ill., digital ;; 24 cm.
Contained By:
Springer eBooks
標題:
Graph theory.
標題:
Representations of graphs.
標題:
Computer Science.
標題:
Theory of Computation.
標題:
Mathematics of Computing.
標題:
Algebra.
ISBN:
9783319258591
ISBN:
9783319258577
內容註:
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.
摘要、提要註:
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.
電子資源:
http://dx.doi.org/10.1007/978-3-319-25859-1
Words and graphs[electronic resource] /
Kitaev, Sergey.
Words and graphs
[electronic resource] /by Sergey Kitaev, Vadim Lozin. - Cham :Springer International Publishing :2015. - xviii, 264 p. :ill., digital ;24 cm. - Monographs in theoretical computer science. An EATCS series,1431-2654. - Monographs in theoretical computer science.An EATCS series..
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.
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.
ISBN: 9783319258591
Standard No.: 10.1007/978-3-319-25859-1doiSubjects--Topical Terms:
381176
Graph theory.
LC Class. No.: QA166
Dewey Class. No.: 511.5
Words and graphs[electronic resource] /
LDR
:02520nam a2200349 a 4500
001
443886
003
DE-He213
005
20160428085637.0
006
m d
007
cr nn 008maaau
008
160715s2015 gw s 0 eng d
020
$a
9783319258591
$q
(electronic bk.)
020
$a
9783319258577
$q
(paper)
024
7
$a
10.1007/978-3-319-25859-1
$2
doi
035
$a
978-3-319-25859-1
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA166
072
7
$a
UY
$2
bicssc
072
7
$a
UYA
$2
bicssc
072
7
$a
COM014000
$2
bisacsh
072
7
$a
COM031000
$2
bisacsh
082
0 4
$a
511.5
$2
23
090
$a
QA166
$b
.K62 2015
100
1
$a
Kitaev, Sergey.
$3
634968
245
1 0
$a
Words and graphs
$h
[electronic resource] /
$c
by Sergey Kitaev, Vadim Lozin.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2015.
300
$a
xviii, 264 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Monographs in theoretical computer science. An EATCS series,
$x
1431-2654
505
0
$a
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
$a
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
$a
Graph theory.
$3
381176
650
0
$a
Representations of graphs.
$3
634971
650
1 4
$a
Computer Science.
$3
423143
650
2 4
$a
Theory of Computation.
$3
464054
650
2 4
$a
Mathematics of Computing.
$3
465323
650
2 4
$a
Algebra.
$3
189734
700
1
$a
Lozin, Vadim.
$3
634969
710
2
$a
SpringerLink (Online service)
$3
463450
773
0
$t
Springer eBooks
830
0
$a
Monographs in theoretical computer science.
$p
An EATCS series.
$3
634970
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-25859-1
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-25859-1
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入