AAAAAA

   
Results: 1-16 |
Results: 16
TOUGHNESS AND LONGEST CYCLES IN 2-CONNECTED PLANAR GRAPHS
Authors: BOHME T BROERSMA HJ VELDMAN HJ
Citation: T. Bohme et al., TOUGHNESS AND LONGEST CYCLES IN 2-CONNECTED PLANAR GRAPHS, Journal of graph theory, 23(3), 1996, pp. 257-263
HAMILTONICITY OF REGULAR 2-CONNECTED GRAPHS
Authors: BROERSMA HJ VANDENHEUVEL J JACKSON B VELDMAN HJ
Citation: Hj. Broersma et al., HAMILTONICITY OF REGULAR 2-CONNECTED GRAPHS, Journal of graph theory, 22(2), 1996, pp. 105-124
TOUGHNESS AND HAMILTONICITY IN ALMOST CLAW-FREE GRAPHS
Authors: BROERSMA HJ RYJACEK Z SCHIERMEYER I
Citation: Hj. Broersma et al., TOUGHNESS AND HAMILTONICITY IN ALMOST CLAW-FREE GRAPHS, Journal of graph theory, 21(4), 1996, pp. 431-439
ON GRAPHS SATISFYING A LOCAL ORE-TYPE CONDITION
Authors: ASRATIAN AS BROERSMA HJ VANDENHEUVEL J VELDMAN HJ
Citation: As. Asratian et al., ON GRAPHS SATISFYING A LOCAL ORE-TYPE CONDITION, Journal of graph theory, 21(1), 1996, pp. 1-10
CYCLES THROUGH PARTICULAR SUBGRAPHS OF CLAW-FREE GRAPHS
Authors: BROERSMA HJ LU M
Citation: Hj. Broersma et M. Lu, CYCLES THROUGH PARTICULAR SUBGRAPHS OF CLAW-FREE GRAPHS, Journal of graph theory, 20(4), 1995, pp. 459-465
BIPARTITE REGULAR GRAPHS WITH FIXED DIAMETER
Authors: BROERSMA HJ GOBEL F
Citation: Hj. Broersma et F. Gobel, BIPARTITE REGULAR GRAPHS WITH FIXED DIAMETER, Networks, 26(3), 1995, pp. 139-144
SUBGRAPHS, CLOSURES AND HAMILTONICITY
Authors: BROERSMA HJ SCHIERMEYER I
Citation: Hj. Broersma et I. Schiermeyer, SUBGRAPHS, CLOSURES AND HAMILTONICITY, Discrete applied mathematics, 51(1-2), 1994, pp. 39-46
ON HAMILTONIAN PROPERTIES OF 2-TOUGH GRAPHS
Authors: BAUER D BROERSMA HJ VANDENHEUVEL J VELDMAN HJ
Citation: D. Bauer et al., ON HAMILTONIAN PROPERTIES OF 2-TOUGH GRAPHS, Journal of graph theory, 18(6), 1994, pp. 539-543
ON THE MATCHING POLYNOMIAL OF A POLYGRAPH
Authors: BROERSMA HJ LI XL
Citation: Hj. Broersma et Xl. Li, ON THE MATCHING POLYNOMIAL OF A POLYGRAPH, Discrete applied mathematics, 46(1), 1993, pp. 79-86
GENERATING ALL 3-CONNECTED 4-REGULAR PLANAR GRAPHS FROM THE OCTAHEDRON GRAPH
Authors: BROERSMA HJ DUIJVESTIJN AJW GOBEL F
Citation: Hj. Broersma et al., GENERATING ALL 3-CONNECTED 4-REGULAR PLANAR GRAPHS FROM THE OCTAHEDRON GRAPH, Journal of graph theory, 17(5), 1993, pp. 613-620
CYCLES CONTAINING ALL VERTICES OF MAXIMUM DEGREE
Authors: BROERSMA HJ VANDENHEUVEL J JUNG HA VELDMAN HJ
Citation: Hj. Broersma et al., CYCLES CONTAINING ALL VERTICES OF MAXIMUM DEGREE, Journal of graph theory, 17(3), 1993, pp. 373-385
DECOMPOSITION OF BIPARTITE GRAPHS UNDER DEGREE CONSTRAINTS
Authors: BROERSMA HJ FAUDREE RJ VANDENHEUVEL J VELDMAN HJ
Citation: Hj. Broersma et al., DECOMPOSITION OF BIPARTITE GRAPHS UNDER DEGREE CONSTRAINTS, Networks, 23(3), 1993, pp. 159-164
A GENERALIZATION OF ORE THEOREM INVOLVING NEIGHBORHOOD UNIONS
Authors: BROERSMA HJ VANDENHEUVEL J VELDMAN HJ
Citation: Hj. Broersma et al., A GENERALIZATION OF ORE THEOREM INVOLVING NEIGHBORHOOD UNIONS, Discrete mathematics, 122(1-3), 1993, pp. 37-49
A NOTE ON K-4-CLOSURES IN HAMILTONIAN GRAPH-THEORY
Authors: BROERSMA HJ
Citation: Hj. Broersma, A NOTE ON K-4-CLOSURES IN HAMILTONIAN GRAPH-THEORY, Discrete mathematics, 121(1-3), 1993, pp. 19-23
LONG CYCLES, DEGREE SUMS AND NEIGHBORHOOD UNIONS
Authors: BROERSMA HJ VANDENHEUVEL J VELDMAN HJ
Citation: Hj. Broersma et al., LONG CYCLES, DEGREE SUMS AND NEIGHBORHOOD UNIONS, Discrete mathematics, 121(1-3), 1993, pp. 25-35
COLORING A GRAPH OPTIMALLY WITH 2 COLORS
Authors: BROERSMA HJ GOBEL F
Citation: Hj. Broersma et F. Gobel, COLORING A GRAPH OPTIMALLY WITH 2 COLORS, Discrete mathematics, 118(1-3), 1993, pp. 23-31
Risultati: 1-16 |