- Author:
- Robert Carl Kremer,
- Adviser:
- Brian R. Gaines
No abstract available.
Cited By
- Starr R and Parente De Oliveira J (2013). Concept maps as the first step in an ontology construction method, Information Systems, 38:5, (771-783), Online publication date: 1-Jul-2013.
Karvonen A, Rautama E, Tarhio J and Turkia J Versatile concept map viewing on the Web Proceedings of the 6th annual conference on Innovation and technology in computer science education, (105-108)- Karvonen A, Rautama E, Tarhio J and Turkia J (2001). Versatile concept map viewing on the Web, ACM SIGCSE Bulletin, 33:3, (105-108), Online publication date: 1-Sep-2001.
- Thomson J, Greer J and Cooke J Generating instructional hypermedia with APHID Proceedings of the eleventh ACM on Hypertext and hypermedia, (248-249)
- Carriço L and Guimarães N Manipulating concept maps with constrained regions Proceedings of the working conference on Advanced visual interfaces, (226-234)
Recommendations
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied MathematicsAbstractComparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Collapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Equimatchable Graphs on Surfaces
A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...