找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Words and Graphs; Sergey Kitaev,Vadim Lozin Book 2015 Springer International Publishing Switzerland 2015 Combinatorics.Complexity.Enumerat

[復(fù)制鏈接]
查看: 22297|回復(fù): 43
樓主
發(fā)表于 2025-3-21 18:37:51 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Words and Graphs
編輯Sergey Kitaev,Vadim Lozin
視頻videohttp://file.papertrans.cn/1031/1030730/1030730.mp4
概述Self-contained survey, useful for learning and reference.Authors among key researchers in this field.Suggests problems and directions for further research
叢書名稱Monographs in Theoretical Computer Science. An EATCS Series
圖書封面Titlebook: Words and Graphs;  Sergey Kitaev,Vadim Lozin Book 2015 Springer International Publishing Switzerland 2015 Combinatorics.Complexity.Enumerat
描述.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.?.
出版日期Book 2015
關(guān)鍵詞Combinatorics; Complexity; Enumeration; Graph theory; Graphs; Hereditary class of graphs; Structure; Word-r
版次1
doihttps://doi.org/10.1007/978-3-319-25859-1
isbn_softcover978-3-319-35669-3
isbn_ebook978-3-319-25859-1Series ISSN 1431-2654 Series E-ISSN 2193-2069
issn_series 1431-2654
copyrightSpringer International Publishing Switzerland 2015
The information of publication is updating

書目名稱Words and Graphs影響因子(影響力)




書目名稱Words and Graphs影響因子(影響力)學(xué)科排名




書目名稱Words and Graphs網(wǎng)絡(luò)公開度




書目名稱Words and Graphs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Words and Graphs被引頻次




書目名稱Words and Graphs被引頻次學(xué)科排名




書目名稱Words and Graphs年度引用




書目名稱Words and Graphs年度引用學(xué)科排名




書目名稱Words and Graphs讀者反饋




書目名稱Words and Graphs讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:57:51 | 只看該作者
Hereditary Classes of Graphs,take a little tour through the world of hereditary classes. In particular, we will survey basic results related to this notion and will introduce various hereditary classes pertinent to word-representable graphs. We start with a formal definition.
板凳
發(fā)表于 2025-3-22 00:34:58 | 只看該作者
Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations,on [74, 75], a generalization of this theorem to the case of arbitrary word-representable graphs and so-called . (see Theorem 4.1.8). These acyclic orientations, being a generalization of transitive orientations related to partial orders, provide a powerful tool for studying word-representable graph
地板
發(fā)表于 2025-3-22 07:41:52 | 只看該作者
5#
發(fā)表于 2025-3-22 11:14:37 | 只看該作者
Book 2015 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 discus
6#
發(fā)表于 2025-3-22 14:59:31 | 只看該作者
Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations,ientations, being a generalization of transitive orientations related to partial orders, provide a powerful tool for studying word-representable graphs, in particular, allowing us to reformulate word-representability problems in pure graph-theoretical terms (via certain orientations of graphs).
7#
發(fā)表于 2025-3-22 18:22:32 | 只看該作者
8#
發(fā)表于 2025-3-22 23:09:11 | 只看該作者
9#
發(fā)表于 2025-3-23 01:36:00 | 只看該作者
10#
發(fā)表于 2025-3-23 05:57:49 | 只看該作者
https://doi.org/10.1007/978-3-319-25859-1Combinatorics; Complexity; Enumeration; Graph theory; Graphs; Hereditary class of graphs; Structure; Word-r
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-20 13:07
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
临沂市| 彰武县| 丹阳市| 岳池县| 德安县| 屏东市| 昆明市| 英山县| 旌德县| 冕宁县| 西畴县| 南阳市| 遵义县| 湖南省| 峨眉山市| 上犹县| 辽宁省| 偃师市| 通道| 江口县| 农安县| 梅州市| 荥阳市| 甘孜县| 金溪县| 呈贡县| 克山县| 临湘市| 沙湾县| 元阳县| 渭南市| 大安市| 涡阳县| 德保县| 永年县| 平和县| 定安县| 泸水县| 凤凰县| 高雄市| 寿光市|