找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 22176|回复: 43
发表于 2025-3-21 18:37:51 | 显示全部楼层 |阅读模式
书目名称Words and Graphs
编辑Sergey Kitaev,Vadim Lozin
视频video
概述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
关键词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影响因子(影响力)学科排名




书目名称Words and Graphs网络公开度




书目名称Words and Graphs网络公开度学科排名




书目名称Words and Graphs被引频次




书目名称Words and Graphs被引频次学科排名




书目名称Words and Graphs年度引用




书目名称Words and Graphs年度引用学科排名




书目名称Words and Graphs读者反馈




书目名称Words and Graphs读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 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.
发表于 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
发表于 2025-3-22 07:41:52 | 显示全部楼层
发表于 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
发表于 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).
发表于 2025-3-22 18:22:32 | 显示全部楼层
发表于 2025-3-22 23:09:11 | 显示全部楼层
发表于 2025-3-23 01:36:00 | 显示全部楼层
发表于 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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-14 23:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表