The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles
Sign Up to like & getrecommendations! Published in 2023 at "Axioms"
DOI: 10.3390/axioms12020173
Abstract: A graph G has a (d,h)-decomposition if there is a pair (D,F) such that F is a subgraph of G and D is an acyclic orientation of G−E(F), where the maximum degree of F is… read more here.
Keywords: without adjacent; decomposability toroidal; graphs without; toroidal graphs ... See more keywords