Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck Fulltext Access 8 Pages 2009
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009) Fulltext Access 8 Pages 2009
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles Fulltext Access 8 Pages 2009
An upper bound on the domination number of a graph with minimum degree 2 Fulltext Access 8 Pages 2009
Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation Fulltext Access 8 Pages 2009
Indecomposability graph and critical vertices of an indecomposable graph Fulltext Access 8 Pages 2009
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs Fulltext Access 8 Pages 2009
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems Fulltext Access 8 Pages 2009
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs Fulltext Access 8 Pages 2009
A new representation of proper interval graphs with an application to clique-width Fulltext Access 8 Pages 2009
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio Fulltext Access 8 Pages 2009
On the complexity of SNP block partitioning under the perfect phylogeny model Fulltext Access 8 Pages 2009
The Erdős–Ko–Rado properties of set systems defined by double partitions Fulltext Access 8 Pages 2009
PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm Fulltext Access 8 Pages 2009
Kick-Start Activation to Novice Programming — A Visualization-Based Approach Fulltext Access 8 Pages 2009
Resolvable group divisible designs with block size four and general index Fulltext Access 8 Pages 2009
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps Fulltext Access 8 Pages 2009
Deriving Safety Cases for the Formal Safety Certification of Automatically Generated Code Fulltext Access 8 Pages 2009
Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five Fulltext Access 8 Pages 2009
Generalizations of Świerczkowski’s lemma and the arity gap of finite functions Fulltext Access 8 Pages 2009