A5083001022- Advanced Graph Theory Research
- Interconnection Networks and Systems
- Graph theory and applications
- Limits and Structures in Graph Theory
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
- graph theory and CDMA systems
- Finite Group Theory Research
- Computational Geometry and Mesh Generation
- Optimization and Search Problems
- Advanced Database Systems and Queries
- Caching and Content Delivery
- Rings, Modules, and Algebras
- Advanced Materials and Mechanics
- semigroups and automata theory
- Data Management and Algorithms
Millersville University
2012-2025
West Virginia University
2002-2022
Kutztown University
2022
Xinjiang University
2022
University of Scranton
2022
Pennsylvania State University
2022
Morgantown High School
2003
A graph G is N2-locally connected if for every vertex ν in G, the edges not incident with but having at least one end adjacent to induce a graph. In 1990, Ryjáček conjectured that 3-connected claw-free Hamiltonian. This conjecture proved this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005
Abstract A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining reduced nonsupereulerian graphs with small orders, as such results are particular importance study Eulerian subgraphs and Hamiltonian line graphs. We determine all order at most 14 few vertices degree 2, extending former Chen 2016. In 1985, Bauer proposed problems best possible sufficient conditions on minimum simple (or bipartite graph, respectively) G to ensure that its...