✦ LIBER ✦

A sufficient condition for graphs to be -optimal

✍ Scribed by Wang, Ruixia; Wang, Shiying

Book ID: 122668798
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 378 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.05.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be λk-optimal with given girth and diameter

✍ Zhao Zhang; Qinghai Liu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 5573 || A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices

✍ Du, Ding-Zhu; Hu, Xiaodong; Pardalos, Panos M. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 509 KB

A sufficient condition for graphs to be

A sufficient condition for graphs to be fractional -deleted graphs

✍ Sizhong Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB

graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) → [0, 1] be a function. If ∑ e∋x h(e) = k holds for each x ∈ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet

A sufficient condition for oriented grap

A sufficient condition for oriented graphs to be Hamiltonian

✍ Odile Favaron; Oscar Ordaz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be Hamiltonian

✍ S Goodman; S Hedetniemi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A sufficient condition for planar graphs

A sufficient condition for planar graphs to be 3-colorable

✍ O.V Borodin; A Raspaud 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 168 KB