Minimum Fill-In and Treewidth of Split+ Ke and Split+ Kv Graphs

doi 10.1007/978-3-540-77120-3_76
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Generalized Split Graphs and Ramsey Numbers

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

Split Block Domination in Graphs

International Journal of Research in Engineering and Technology
2013English

Fully Decomposable Split Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Almost All Chordal Graphs Split

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1985English

Strong Non-Split Domination in Directed Graphs

Annals of Pure and Applied Mathematics
2017English

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Dynamic Distance Hereditary Graphs Using Split Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Mixed Search Number and Linear-Width of Interval and Split Graphs

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy