Titlebook: ;

Braggart

书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)




书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名




书目名称Graph-Theoretic Concepts in Computer Science网络公开度




书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名




书目名称Graph-Theoretic Concepts in Computer Science被引频次




书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名




书目名称Graph-Theoretic Concepts in Computer Science年度引用




书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名




书目名称Graph-Theoretic Concepts in Computer Science读者反馈




书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名

jocular

,Extension Complexity of Stable Set Polytopes of Bipartite Graphs, bound, we show that . is ., which is an improvement when . has quadratically many edges. For the lower bound, we prove that . is . when . is the incidence graph of a finite projective plane. We also provide examples of 3-regular bipartite graphs . such that the edge vs stable set matrix of . has a fooling set of size |.(.)|.

不透气

表示向前

occult

https://doi.org/10.1007/978-1-4471-0399-8rize the complexity of the recognition problems for the classes of outer segment, grounded segment, and ray intersection graphs. We prove that these recognition problems are complete for the existential theory of the reals. This holds even if a 1-string realization is given as additional input.

飞镖

Hierarchical Partial Planarity,grees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.

飞镖

Intersection Graphs of Rays and Grounded Segments,rize the complexity of the recognition problems for the classes of outer segment, grounded segment, and ray intersection graphs. We prove that these recognition problems are complete for the existential theory of the reals. This holds even if a 1-string realization is given as additional input.

tolerance

https://doi.org/10.1007/978-3-030-92735-6 can be partitioned. We provide tight upper bounds in terms of the maximum degree and characterize all extremal graphs. Our constructive proofs yield efficient algorithms to determine the corresponding edge colorings.

foodstuff

https://doi.org/10.1007/978-3-642-80530-1he two stubborn cases, namely for the case . by proving that the class of .-free graphs has bounded clique-width and is well-quasi-ordered. Our technique is based on a special decomposition of 3-partite graphs. We also use this technique to completely determine which classes of .-free graphs are well-quasi-ordered.

极肥胖