Add to ORKGSIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
AbstractA sequence 〈di〉, 1≤i≤n, is called graphical if there exists a graph whose ith vertex has deg...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
AbstractA sequence 〈di〉, 1≤i≤n, is called graphical if there exists a graph whose ith vertex has deg...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...