Titlebook: ;

ATRIA

https://doi.org/10.1007/978-1-4615-4297-1thms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS., operating on the complement of the given graph . and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of . or identifies an induced ...

Deadpan

Matching, Edge-Colouring, and Dimers the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erdős and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound for s dimer constant.

烦躁的女人

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generationible in linear time, implies the existence of bijection between rooted outerplanar maps with . nodes and bicolored rooted ordered trees with . nodes where all the nodes of the last branch are colored white. As a consequence, for rooted outerplanar maps of . nodes, we derive: