Matches in SemOpenAlex for { <https://semopenalex.org/work/W2049494157> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2049494157 endingPage "630" @default.
- W2049494157 startingPage "625" @default.
- W2049494157 abstract "A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum positive integer p such that whenever the edges of the graph G are colored with r colors, the vertices of G can be covered by at most p vertex-disjoint heterochromatic trees. In this paper we determine the heterochromatic tree partition number of r-edge-colored complete graphs. We also find at most t r (K n ) vertex-disjoint heterochromatic trees to cover all the vertices in polynomial time for a given r-edge-coloring of K n ." @default.
- W2049494157 created "2016-06-24" @default.
- W2049494157 creator A5030357379 @default.
- W2049494157 creator A5049379038 @default.
- W2049494157 date "2012-10-01" @default.
- W2049494157 modified "2023-10-06" @default.
- W2049494157 title "Partitioning complete graphs by heterochromatic trees" @default.
- W2049494157 cites W1664893882 @default.
- W2049494157 cites W1968948734 @default.
- W2049494157 cites W1978665169 @default.
- W2049494157 cites W1981338295 @default.
- W2049494157 cites W2026904819 @default.
- W2049494157 cites W2047318259 @default.
- W2049494157 cites W2057452136 @default.
- W2049494157 cites W2126525415 @default.
- W2049494157 cites W2158661310 @default.
- W2049494157 cites W2166524975 @default.
- W2049494157 cites W2170028807 @default.
- W2049494157 cites W4231988343 @default.
- W2049494157 doi "https://doi.org/10.1007/s10255-012-0177-z" @default.
- W2049494157 hasPublicationYear "2012" @default.
- W2049494157 type Work @default.
- W2049494157 sameAs 2049494157 @default.
- W2049494157 citedByCount "1" @default.
- W2049494157 countsByYear W20494941572012 @default.
- W2049494157 crossrefType "journal-article" @default.
- W2049494157 hasAuthorship W2049494157A5030357379 @default.
- W2049494157 hasAuthorship W2049494157A5049379038 @default.
- W2049494157 hasBestOaLocation W20494941572 @default.
- W2049494157 hasConcept C114614502 @default.
- W2049494157 hasConcept C118615104 @default.
- W2049494157 hasConcept C132525143 @default.
- W2049494157 hasConcept C33923547 @default.
- W2049494157 hasConcept C42812 @default.
- W2049494157 hasConcept C45340560 @default.
- W2049494157 hasConcept C80899671 @default.
- W2049494157 hasConceptScore W2049494157C114614502 @default.
- W2049494157 hasConceptScore W2049494157C118615104 @default.
- W2049494157 hasConceptScore W2049494157C132525143 @default.
- W2049494157 hasConceptScore W2049494157C33923547 @default.
- W2049494157 hasConceptScore W2049494157C42812 @default.
- W2049494157 hasConceptScore W2049494157C45340560 @default.
- W2049494157 hasConceptScore W2049494157C80899671 @default.
- W2049494157 hasIssue "4" @default.
- W2049494157 hasLocation W20494941571 @default.
- W2049494157 hasLocation W20494941572 @default.
- W2049494157 hasOpenAccess W2049494157 @default.
- W2049494157 hasPrimaryLocation W20494941571 @default.
- W2049494157 hasRelatedWork W1559700736 @default.
- W2049494157 hasRelatedWork W2297531352 @default.
- W2049494157 hasRelatedWork W2369348675 @default.
- W2049494157 hasRelatedWork W2780151222 @default.
- W2049494157 hasRelatedWork W3193623490 @default.
- W2049494157 hasRelatedWork W3210693467 @default.
- W2049494157 hasRelatedWork W4226484513 @default.
- W2049494157 hasRelatedWork W4244487191 @default.
- W2049494157 hasRelatedWork W4307106633 @default.
- W2049494157 hasRelatedWork W4361001074 @default.
- W2049494157 hasVolume "28" @default.
- W2049494157 isParatext "false" @default.
- W2049494157 isRetracted "false" @default.
- W2049494157 magId "2049494157" @default.
- W2049494157 workType "article" @default.