Results 121 to 130 of about 435,813 (301)
Recoloring via Modular Decomposition
ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi +2 more
wiley +1 more source
The Effect of Leadership and Financial Incentives on Job Satisfaction and Employees Performance at Ud. Kusuma Bali Mandiri [PDF]
Faculty of Economics and Business, Mahasaraswati University Denpasar
openalex +1 more source
Abstract Social interaction is widely recognised as a critical component of effective learning. However, as online learning becomes increasingly embedded within higher education, digital environments continue to face persistent difficulties in fostering meaningful social learning experiences.
Wimukthi Thommadurage +4 more
wiley +1 more source
Village Government Management Practices in The Development of Tourism Villages in Baha Village, Mengwi District, Badung Regency, Bali Province [PDF]
I Janamijaya +3 more
openalex +1 more source

