潜伏期 发表于 2025-3-23 13:03:36

http://reply.papertrans.cn/32/3186/318517/318517_11.png

FACT 发表于 2025-3-23 14:46:10

http://reply.papertrans.cn/32/3186/318517/318517_12.png

歌唱队 发表于 2025-3-23 20:43:26

Jiadao Li,Oliver Wéldrich,Wolfgang ZieglerA vertex . of a graph . is called a . if . has more components than .. In particular, if . is connected and . is a cutpoint then . is disconnected. Similarly, an edge is called a . if its deletion increases the number of components in the graph.

会议 发表于 2025-3-24 01:53:50

Rod Tyers,Jane Golley,Iain BainLet . be a finite nonempty set and let . be a set of its subsets satisfying the following two conditions, called .:

抱怨 发表于 2025-3-24 04:20:04

Ten Tips to Become a Better Security Tester,Recall that a continuous rectifiable curve without self-intersections is called a ..

GRAIN 发表于 2025-3-24 09:40:17

http://reply.papertrans.cn/32/3186/318517/318517_16.png

小教堂 发表于 2025-3-24 12:15:22

http://reply.papertrans.cn/32/3186/318517/318517_17.png

CIS 发表于 2025-3-24 15:21:46

Éva Szöke,Ágnes Kéry,Éva LemberkovicsA . of a graph . in . colors, or ., is a function . : . → {1, 2, ... , .} such that .(.) ≠ .(.) for any adjacent vertices . of .. The number .(.) is called the . of the vertex .. A graph that has a proper .-coloring is called ..

membrane 发表于 2025-3-24 21:02:21

http://reply.papertrans.cn/32/3186/318517/318517_19.png

ALLEY 发表于 2025-3-25 02:08:51

Trees,A . is a connected graph without cycles. An arbitrary graph without cycles is called a . (or .). Therefore the components of a forest are trees.
页: 1 [2] 3 4 5
查看完整版本: Titlebook: Exercises in Graph Theory; O. Melnikov,V. Sarvanov,I. Zverovich Textbook 1998 Springer Science+Business Media B.V., part of Springer Natur