نتائج البحث

On the circuit cover problem for mixed graphs

• Authors : Orlando Lee; Yoshiko Wakabayashi

Subjects: Statistics and Probability; Discrete mathematics; Applied Mathematics

• Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

Nonseparating Planar Chains in 4-Connected Graphs

• Authors : Sean Curran; Orlando Lee; Xingxing Yu

Subjects: Combinatorics; Discrete mathematics; Planar

• Source: SIAM Journal on Discrete Mathematics. 19:399-419

تفاصيل العنوان

Chain Decompositions of 4-Connected Graphs

• Authors : Orlando Lee; Sean Curran; Xingxing Yu

Subjects: Discrete mathematics; General Mathematics; Symmetric graph

• Source: SIAM Journal on Discrete Mathematics. 19:848-880

تفاصيل العنوان

Non-Separating Paths in 4-Connected Graphs

• Authors : Orlando Lee; Xingxing Yu; Ken-ichi Kawarabayashi

Subjects: Combinatorics; Discrete mathematics; Discrete Mathematics and Combinatorics

• Source: Annals of Combinatorics. 9:47-56

تفاصيل العنوان

Finding Four Independent Trees

• Authors : Orlando Lee; Sean Curran; Xingxing Yu

Subjects: Discrete mathematics; Combinatorics; Spanning tree

• Source: SIAM Journal on Computing. 35:1023-1058

تفاصيل العنوان

A weaker version of Lovász' path removal conjecture

• Authors : Ken-ichi Kawarabayashi; Paul Wollan; Orlando Lee

Subjects: Discrete mathematics; Removable paths; Graph connectivity

• Source: Journal of Combinatorial Theory, Series B. 98(5):972-979

تفاصيل العنوان

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

• Authors : Orlando Lee; Cristina G. Fernandes; Yoshiko Wakabayashi

Subjects: Polynomial algorithms; Vertex (graph theory); Discrete mathematics

• Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

Removable cycles in non-bipartite graphs

• Authors : Orlando Lee; Ken-ichi Kawarabayashi; Bruce Reed ...

Subjects: Discrete mathematics; Removable paths; Odd cycles

• Source: Journal of Combinatorial Theory, Series BJournal of Combinatorial Theory, Series B, Elsevier, 2009, 99, pp.30―38. ⟨10.1016/j.jctb.2008.03.007⟩Journal of Combinatorial Theory, Series

تفاصيل العنوان

A Faster Algorithm for Packing Branchings in Digraphs

• Authors : Orlando Lee; Mario Leston-Rey

Subjects: Discrete mathematics; FOS: Computer and information sciences; Arborescence

تفاصيل العنوان

Spanning trees with nonseparating paths

• Authors : César Hernández-Vélez; José Coelho de Pina; Cristina G. Fernandes

Subjects: 05C05, 05C38; TEORIA DOS GRAFOS; 0102 computer and information sciences

• Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان