Brain-Waves 发表于 2025-4-1 04:19:14

Regular Factors Containing a Given Hamiltonian Cycle,nd the degree sum of each pair of nonadjacent vertices in . is at least . + ., where . = 3 for odd . and . = 4 for even .. Then . has a . – factor (i.e. a . – regular spanning subgraph) which is edge-disjoint from a given Hamiltonian cycle. The lower bound on the degree condition is sharp. As a cons
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Combinatorial Geometry and Graph Theory; Indonesia-Japan Join Jin Akiyama,Edy Tri Baskoro,Mikio Kano Conference proceedings 2005 Springer-V