AI & ChatGPT searches , social queries for PATH COLORING
Search references for PATH COLORING. Phrases containing PATH COLORING
See searches and references containing PATH COLORING!
Search references for PATH COLORING. Phrases containing PATH COLORING
See searches and references containing PATH COLORING!PATH COLORING
Graph coloring problem on paths in a network
theory, path coloring is a type of graph coloring where colors (or wavelengths) are assigned to a set of paths in a graph such that any two paths sharing
Path_coloring
Assignment of colors to edges of a graph
edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem
Edge_coloring
Methodic assignment of colors to elements of a graph
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Graph_coloring
Algorithm in graph theory
Gries edge-coloring algorithm is a polynomial-time algorithm in graph theory that finds an edge coloring of any simple graph. The coloring produced uses
Misra & Gries edge-coloring algorithm
Misra_&_Gries_edge-coloring_algorithm
Water-soluble food coloring
Caramel color or caramel coloring is a water-soluble food coloring. It is made by heat treatment of carbohydrates (sugars), in general in the presence
Caramel_coloring
Graph coloring avoiding 2-colored paths
mathematical field of graph theory, a star coloring of a graph G is a (proper) vertex coloring in which every path on four vertices uses at least three distinct
Star_coloring
Path on an edge-colored graph over which no color repeats
{\displaystyle {\text{src}}(G)} . Clearly, each strong rainbow coloring is also a rainbow coloring, while the converse is not true in general. It is easy to
Rainbow_coloring
Coloring in which edges are labeled by integers
Path coloring Defective coloring L(h, k)-coloring Incidence coloring Total coloring Radio coloring Acyclic coloring Star coloring Harmonious coloring
Interval_edge_coloring
star edge coloring of a graph G is a proper edge coloring without bichromatic paths and cycles of length four, similar to the star coloring of a graph
Corona_product
Graph coloring where each vertex has a list of allowed colors
In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It
List_coloring
nonrepetitive coloring of a graph to be an assignment of colors to the edges of the graph, such that there does not exist any even-length simple path in the
Thue_number
Duality of graph colorings and orientations
equal to the minimum number of vertices in a longest path, suppose that a given graph has a coloring with k {\displaystyle k} colors, for some number k
Gallai–Hasse–Roy–Vitaver theorem
Gallai–Hasse–Roy–Vitaver_theorem
Hamiltonian coloring, named after William Rowan Hamilton, is a type of graph coloring. Hamiltonian coloring uses a concept called detour distance between
Hamiltonian_coloring
graph theory, a branch of mathematics, a radio coloring of an undirected graph is a form of graph coloring in which one assigns positive integer labels
Radio_coloring
Graph coloring with one edge per color pair
For instance, a path with three edges has a complete 3-coloring. Exact colorings are closely related to harmonious colorings (colorings in which each pair
Exact_coloring
Special labeling in graph theory
L(h, k)-coloring Harmonious coloring Star coloring Total coloring Circular coloring Path coloring Defective coloring Radio coloring Acyclic coloring
Incidence_coloring
cliques, independent sets, colorings, or spanning trees), or of algorithmically listing all such objects. Eulerian An Eulerian path is a walk that uses every
Glossary_of_graph_theory
Strong coloring Subcoloring Tait's conjecture Total coloring Uniquely colorable graph Path (graph theory) Seven Bridges of Königsberg Eulerian path Three-cottage
List_of_graph_theory_topics
four-vertex path. Coloring the vertices in path order uses two colors, the optimum for this graph. However, coloring the ends of the path first (using
Well-colored_graph
Unsolved problem in the mathematics of graph coloring
problem in mathematics Can every two ( d + 2 ) {\displaystyle (d+2)} -colorings of a d {\displaystyle d} -degenerate graph be transformed into each other
Cereceda's_conjecture
Area of discrete mathematics
number of coloring plane such that no two points at a unit distance from each other have the same color, and shortest path problem on finding a path between
Graph_theory
Maximum number of colors obtainable by a greedy graph coloring algorithm
Grundy number is three: if the two endpoints of the path are colored first, the greedy coloring algorithm will use three colors for the whole graph.
Grundy_number
Planar maps require at most four colors
red-blue alternating paths, and then reverse the colors red and blue on all these vertices. The result is still a valid four-coloring, and v can now be added
Four_color_theorem
Process of changing the color of metal surfaces with different chemical solutions
The chemical coloring of metals involve processes that change the color of metal surfaces with different chemical solutions. These processes can be categorized
Chemical_coloring_of_metals
Numerical invariant of graphs
Tree-depth may also be defined using a form of graph coloring. A centered coloring of a graph is a coloring of its vertices with the property that every connected
Tree-depth
On coloring the edges of graphs
α/β-path and set the color of xy to be α, thus creating a proper (Δ+1)-edge-coloring of G from c. The other way around, if a proper (Δ+1)-edge-coloring exists
Vizing's_theorem
Algorithms and methods of plotting the Mandelbrot set on a computing device
show structures of the data (scientific visualisation) A more complex coloring method involves using a histogram which pairs each pixel with said pixel's
Plotting algorithms for the Mandelbrot set
Plotting_algorithms_for_the_Mandelbrot_set
Problem of finding the longest simple path for a given graph
relation between longest paths and graph coloring Longest uncrossed knight's path Snake-in-the-box, the longest induced path in a hypercube graph Price's
Longest_path_problem
Function in algebraic graph theory
graph theory, a branch of mathematics. It counts the number of graph colorings as a function of the number of colors and was originally defined by George
Chromatic_polynomial
Graph divided into two independent sets
endpoints of differing colors, as is required in the graph coloring problem. In contrast, such a coloring is impossible in the case of a non-bipartite graph,
Bipartite_graph
Electrochemical process
Electrochemical coloring of metals is a process in which the surface color of metal is changed by electrochemical techniques, i.e. cathodic or anodic polarization
Electrochemical coloring of metals
Electrochemical_coloring_of_metals
Graph coloring variant in graph theory
In graph theory, a packing coloring (also called a broadcast coloring) is a type of graph coloring where vertices are assigned colors (represented by
Packing_coloring
On graph coloring and neighborhood size
of it in 1941. A coloring with the number of colors described by Brooks' theorem is sometimes called a Brooks coloring or a Δ-coloring. For any connected
Brooks'_theorem
Planar maps require at most five colors
smaller graph with one less vertex, five-coloring that graph, and then using that coloring to determine a coloring for the larger graph in constant time
Five_color_theorem
In the mathematical field of knot theory, Fox n-coloring is a method of specifying a representation of a knot group or a group of a link (not to be confused
Fox_n-coloring
On coloring infinite graphs
In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that, when
De Bruijn–Erdős theorem (graph theory)
De_Bruijn–Erdős_theorem_(graph_theory)
Computer compiler optimization technique
form, the graph coloring portion of the register allocation problem can be solved in linear time. What causes the general graph coloring problem to be NP-complete
Register_allocation
Theorem in graph theory
In graph theory the road coloring theorem, known previously as the road coloring conjecture, deals with synchronized instructions. The issue involves
Road_coloring_theorem
Wireless networking standard
with transmissions in neighboring networks. With basic service set coloring (BSS coloring), a wireless transmission is marked at its very beginning, helping
Wi-Fi_6
05.001, MR 2035386 Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi-k-gons", Ars Combinatoria, 16 (A):
Induced_matching
Vertex coloring where no two linked nodes have the same color pairing
chromatic number); one example is any path of length > 2, which can be 2-colored but has no harmonious coloring with 2 colors. Some properties of χH(G):
Harmonious_coloring
Graph coloring with equal color classes
In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that No
Equitable_coloring
Cubic graph with 10 vertices and 15 edges
constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first
Petersen_graph
Class of mathematical games
the vertex coloring game on a graph G with k colors. Does she have one for k+1 colors? More unsolved problems in mathematics The graph coloring game is a
Graph_coloring_game
Method for finding patterns in networks
connected by a simple path of length k − 1, and then checking whether the two vertices in each pair are connected. Given a coloring function c : V → {1
Color-coding
Microsoft Office suite application to design rich XML-based forms
Microsoft InfoPath is a discontinued software application for designing, distributing, filling and submitting electronic forms containing structured data
Microsoft_InfoPath
Measurement of graph sparsity
k-core number, width, and linkage, and is essentially the same as the coloring number or Szekeres–Wilf number (named after Szekeres and Wilf (1968)).
Degeneracy_(graph_theory)
Graph with directed and undirected edges
are the same, and a closed path is a cycle. A mixed graph is acyclic if it does not contain a cycle. Mixed graph coloring can be thought of as labeling
Mixed_graph
Animation technique in which frames are hand-drawn
that the background layout artists determine the camera angles, camera paths, lighting, and shading of the scene. Character layout artists will determine
Traditional_animation
Theorem on triangulation graph colorings
result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described
Sperner's_lemma
Geometric graph with unit edge lengths
There exist unit distance graphs requiring five colors in any proper coloring, and all unit distance graphs can be colored with at most seven colors
Unit_distance_graph
Principal curcuminoid of turmeric
as an herbal supplement, cosmetics ingredient, food flavoring, and food coloring. Chemically, curcumin is a polyphenol, more particularly a diarylheptanoid
Curcumin
3-regular graph with no 3-edge-coloring
the cycle and replacing the resulting paths of degree-two vertices by single edges. It has a three-edge-coloring if and only if at least one of these simplifications
Snark_(graph_theory)
Graph with all vertices of degree 3
3-edge-coloring is known as a Tait coloring, and forms a partition of the edges of the graph into three perfect matchings. By Kőnig's line coloring theorem
Cubic_graph
Special case of the perfect graphs in graph theory
graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering optimally colors every induced subgraph of
Perfectly_orderable_graph
Fractal functions in mathematics
by structure (i.e. by the recursive path taken) instead of monochrome or by density. The tone mapping and coloring are designed to display as much of the
Fractal_flame
1970 F5 tornado in Texas
described as "the most detailed mapping ever done, up to that time, of the path of a single tornado." Originally, the most severe damage was assigned a preliminary
Lubbock_tornado
Chemical element with atomic number 27 (Co)
Frankel, Todd C. (30 September 2016). "The Cobalt Pipeline: Tracing the path from deadly hand-dug mines in Congo to consumers' phones and laptops". The
Cobalt
Producing images of 3D scenes
techniques. Different realistic or stylized effects can be obtained by coloring the pixels covered by the objects in different ways. Surfaces are typically
Rendering_(computer_graphics)
use computer graphics, and the first Studio Ghibli film to use digital coloring; the first animated feature in Japan's history to gross more than 10 billion
List_of_Studio_Ghibli_works
Type of graph coloring
graph theory, a L(h, k)-labelling, L(h, k)-coloring or sometimes L(p, q)-coloring is a (proper) vertex coloring in which every pair of adjacent vertices
L(h,_k)-coloring
Japanese video game development and publishing company
(2012/4/11) 'Coloring Book series / みんなの塗り絵' Little Twin Stars' Coloring Book / Little Twin Starsとみんなの塗り絵 (2011/12/21) My Melody's Coloring Book / マイメロディとみんなの塗り絵
Collavier_Corporation
Graph where all long cycles have a chord
several problems that are hard on other classes of graphs such as graph coloring may be solved in polynomial time when the input is chordal. The treewidth
Chordal_graph
Deleting a graph edge and merging its nodes
to form it. Another example is the coalescing performed in global graph coloring register allocation, where vertices are contracted (where it is safe) in
Edge_contraction
Pencil and paper connection game
players take turns coloring the edges of an arbitrary graph. One player has the goal of connecting two distinguished vertices by a path of edges of their
Shannon_switching_game
Representation of a graph as a path graph "thickened" by some amount
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number
Pathwidth
Graph of short distances in another graph
bounded clique-width, then so do its d-th powers for any fixed d. Graph coloring on the square of a graph may be used to assign frequencies to the participants
Graph_power
Generalization of graph theory
represented by contiguous subsets of these regions, which may be indicated by coloring, by drawing outlines around them, or both. An order-n Venn diagram, for
Hypergraph
interval thickness, and vertex separation number Rank coloring k-Chinese postman Shortest total path length spanning tree Slope number two testing Recognizing
List_of_NP-complete_problems
Structure-preserving correspondence between node-link graphs
oriented coloring of a directed graph is a homomorphism into any oriented graph. An L(2,1)-coloring is a homomorphism into the complement of the path graph
Graph_homomorphism
Doughnut-shaped surface of revolution
can be deformed to a path that circles the body and then the hole. So, strictly 'latitudinal' and strictly 'longitudinal' paths commute. An equivalent
Torus
Programming paradigm focused on difficult search problems
Stable Model: r s Answer: 6 Stable Model: r q s An n {\displaystyle n} -coloring of a graph G = ⟨ V , E ⟩ {\displaystyle G=\left\langle V,E\right\rangle
Answer_set_programming
Self-balancing binary search tree data structure
is modified, the new tree is rearranged and "repainted" to restore the coloring properties that constrain how unbalanced the tree can become in the worst
Red–black_tree
American brand of natural hair care and hair color products
Retrieved 2026-04-12. Martin, Claire (2017-04-22). "A Rare Path: From Venture Capitalist to Hair-Coloring Kits". The New York Times. Retrieved 2019-01-13. "The
Madison_Reed
Characterizes the height of any finite partially ordered set
graphs, to the Gallai–Hasse–Roy–Vitaver theorem relating longest paths and colorings in graphs, and to the Erdős–Szekeres theorem on monotonic subsequences
Mirsky's_theorem
Graph formed from disjoint paths
{\displaystyle \lfloor (\Delta +1)/2\rfloor } . A linear coloring of a graph is a proper graph coloring in which the induced subgraph formed by each two colors
Linear_forest
American actor and comedian (1951–2014)
to critic James Poniewozik. Mork became popular, featured on posters, coloring books, lunch-boxes, and other merchandise. Mork & Mindy was such a success
Robin_Williams
Element of graph theory
of the longest path in an acyclic orientation chosen to minimize this path length. Acyclic orientations are also related to colorings through the chromatic
Acyclic_orientation
On bipartite matching and vertex cover
equals its maximum degree – the latter statement is known as Kőnig's line coloring theorem. However, Bondy & Murty (1976) attribute Kőnig's theorem itself
Kőnig's theorem (graph theory)
Kőnig's_theorem_(graph_theory)
2007 studio album by M83
Waves, Waves" 2:32 2. "Coloring the Void" 3:29 3. "Sister (Part I)" 2:16 4. "Strong and Wasted" 1:58 5. "My Own Strange Path" 3:49 6. "Dancing Mountains"
Digital_Shades_Vol._1
Programming collective communication
such as matrix-vector multiplication, Gaussian elimination and shortest paths. The Message Passing Interface implements broadcast in MPI_Bcast. A message
Broadcast_(parallel_pattern)
Hardware cache of a central processing unit
the cache. The operating system makes this guarantee by enforcing page coloring, which is described below. Some early RISC processors (SPARC, RS/6000)
CPU_cache
American family pop band
Johnny Jackson's drum set, the group's album covers, stickers, posters, and coloring books, as well as a board game and a Saturday morning cartoon; Jackson
The_Jackson_5
conjecture relating coloring to clique minors The Hadwiger–Nelson problem on the chromatic number of unit distance graphs Jaeger's Petersen-coloring conjecture:
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
2012 studio album by Marilyn Manson
a new logo along with a clip of a previously unreleased song. The CMYK coloring was also notable with regard to an acrostic which appeared in a journal
Born_Villain
Type of electron microscope
the sample and generally does not add information about the specimen. Coloring may be performed manually with photo-editing software, or semi-automatically
Scanning_electron_microscope
Canadian rapper and singer (born 1986)
collaboration with the Maple Leafs in November. Drake lives in The Bridle Path, in a 35,000-square-foot, $100 million estate nicknamed "The Embassy", which
Drake_(musician)
Graph with sign-labeled edges
notion of signed graph coloring. Where a coloring of a graph is a mapping from the vertex set to the natural numbers, a coloring of a signed graph is a
Signed_graph
Disproven graph theory
problem of finding 3-edge-colorings of bridgeless cubic planar graphs. In a Hamiltonian cubic planar graph, such an edge coloring is easy to find: use two
Tait's_conjecture
Self-balancing binary search tree
root-leaf path have rank difference 0. The equivalence between the color-based and rank-based definitions can be seen, in one direction, by coloring a node
WAVL_tree
On domino tiling after removing two corners
philosopher Max Black in his book Critical Thinking (1946), with a hint at the coloring-based solution to its impossibility. It was popularized in the 1950s through
Mutilated_chessboard_problem
Hungarian mathematician (1913–1996)
2024. p. 354, Soifer, Alexander (2008); The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators; New York: Springer
Paul_Erdős
Printmaking and design technique
by a border path around the motif. Free-Form Select is also understood in coloring parts of black-and-white images and vice versa. Coloring a single object
Free-form_select
Canadian singer (born 1994)
on the album track "Juke Jam", from Chance the Rapper's third mixtape Coloring Book. On July 22, 2016, Bieber released a new single with EDM trio Major
Justin_Bieber
German mathematician
colors needed in a coloring equals the number of vertices in a longest path, in an orientation chosen to minimize the length of this path. It was stated in
Maria_Hasse
Weather warning indicating imminent danger of tornadoes
warning that is issued by weather forecasting agencies to an area in the path of a tornado, or a severe thunderstorm capable of producing one, and advises
Tornado_warning
American Neo-Nazi pop band
remarked, "there is also the discussion of the lack of 'Prussian Blue' coloring (Zyklon B residue) in the so-called gas chambers in the concentration camps
Prussian_Blue_(duo)
Complexity class
Travelling salesman optimization problem Maximum clique Longest simple path Graph coloring; an application: register allocation in compilers Lists of problems
NP-hardness
Derived graph of higher chromatic number
chromatic number χ ( G ) = k {\displaystyle \chi (G)=k} , consider a proper k-coloring of μ ( G ) − { w } {\displaystyle \mu (G){-}\{w\}} ; that is, a mapping
Mycielskian
Assignment of labels to elements of a graph
harmonious. A graph coloring is a subclass of graph labelings. Vertex colorings assign different labels to adjacent vertices, while edge colorings assign different
Graph_labeling
PATH COLORING
PATH COLORING
Surname or Lastname
English and Scottish
English and Scottish : from the personal name Pat(t), Pate, a short form of Patrick.English and Scottish : nickname for a man with a bald head, from Middle English pate ‘head’, ‘skull’.French (Paté) : from Old French pat(t)é ‘with paws’, ‘pawed’ (from pat(t)e ‘paw’), a nickname, applied presumably to a man with large and clumsy hands and feet.German : nickname for a trustworthy man, from Middle High German pate, Middle Low German pade ‘godfather’, ‘male relative’ (see Paeth), or alternatively from a personal name Bado, probably meaning ‘battle’, ‘fight’.
Surname or Lastname
English (Bristol and Bath)
English (Bristol and Bath) : unexplained.
Female
Hebrew
(בַּתש×וּעַ) Hebrew name BATH-SHUWA means "daughter of wealth." In the bible, this is another name Bath-Sheba is known by.
Female
Hebrew
(×Ö¸×¡Ö°× Ö·×ª) Hebrew name of Egyptian origin, ACÄ”NATH means "belonging to the goddess Neith." In the bible, this is the name of Joseph's Egyptian wife.
Boy/Male
Muslim
Correct path, Straight path
Surname or Lastname
English (Bath)
English (Bath) : unexplained.
Male
Irish
Short form of Irish Gaelic Parthalán, possibly PARTH means "son of Talmai."
Female
English
Short form of English Katherine, KATH means "pure."
Boy/Male
Arabic, Australian, Muslim
Correct Path; Straight Path
Boy/Male
Indian
Victory
Male
English
English unisex short form of English Patrick and Latin Patricia, PAT means "patrician; of noble birth."
Boy/Male
Muslim/Islamic
Correct path Straight path
Surname or Lastname
English (mainly Devon)
English (mainly Devon) : variant of Pate 1.
Female
Hebrew
(בַּת-ש×ֶבַע) Hebrew name BATH-SHEBA means "daughter of the oath." In the bible, this is the name of a wife of Uriah then later King David, and mother of Solomon. Also spelled Bat-Sheva, Bathsheba, and Bathsheva.
Boy/Male
Arabic, Modern
Road; The Way
Surname or Lastname
Scottish
Scottish : reduced form of McGath.English : variant of Garth.North German (Gäth) : variant of Gäde (see Gaede).North German : topographic name from Middle Low German gate ‘street’, ‘alley’.
Female
English
English short form of French Catherine, CATH means "pure."
Girl/Female
Australian, British, English
Way
Surname or Lastname
English
English : habitational name from the city of Bath in western England, which is the site of sumptuous, but in the Middle Ages ruined, Roman baths. The place is named with the dative plural of Old English bæð ‘bath’. In some cases the surname may have originated as a metonymic occupational name for an attendant at a public bath house.Scottish : reduced and altered form of McBeth.German : variant of Bathe.Indian (Panjab) : Sikh name based on the name of a Jat clan.
Female
Hebrew
(בַּתש×וּעַ) Variant spelling of Hebrew Bath-Shuwa, BATH-SHUA means "daughter of wealth."Â
PATH COLORING
PATH COLORING
Female
Babylonian
, early ancestor of the gods.
Girl/Female
Indian
Guest
Boy/Male
Hindu
Lord Murugan
Male
English
Old English Arthurian legend name of a Knight of the Round Table who was the illegitimate son and traitor of King Arthur, possibly MORDRED means "sea counsel." He was brother (or half-brother) to Agravain, Gaheris, Gareth, and Gawain, and noted for having crowned himself and married Guinevere while Arthur was waging war on Emperor Lucius of Rome. He was killed by Arthur at the Battle of Camlann.Â
Girl/Female
African, Australian, Christian, Danish, German
Renowned in Battle; Famous Warrior; Feminine of Louis
Girl/Female
Anglo, British, English
Veiled
Boy/Male
Bengali, Hindu, Indian, Kannada, Sikh, Telugu
A Son of Vatsa
Girl/Female
Indian
Handsome, Tall, Gentleman
Girl/Female
Biblical
Divided.
Girl/Female
American, Australian, Chinese, Spanish
Similar to Marcella of Mars; Warlike; Combination of Maria and Celia
PATH COLORING
PATH COLORING
PATH COLORING
PATH COLORING
PATH COLORING
n.
Fig.: Anything regarded as a patch; a small piece of ground; a tract; a plot; as, scattered patches of trees or growing corn.
adv.
In a pat manner.
n.
The act of exposing the body, or part of the body, for purposes of cleanliness, comfort, health, etc., to water, vapor, hot air, or the like; as, a cold or a hot bath; a medicated bath; a steam bath; a hip bath.
imp. & p. p.
of Path
n.
A small piece of anything used to repair a breach; as, a patch on a kettle, a roof, etc.
v. t.
To mend by sewing on a piece or pieces of cloth, leather, or the like; as, to patch a coat.
pr.p. & vb. n.
of Path
n.
Way; road; path.
pl.
of Path
v. t.
To make a path in, or on (something), or for (some one).
n.
Way; track; path.
n.
A small mass, as of butter, shaped by pats.
v. t.
To mend with pieces; to repair with pieces festened on; to repair clumsily; as, to patch the roof of a house.
n.
Hence: The which contains the strength of life; the vital or essential part; concentrated force; vigor; strength; importance; as, the speech lacked pith.
v. t.
To make of pieces or patches; to repair as with patches; to arrange in a hasty or clumsy manner; -- generally with up; as, to patch up a truce.
n.
A way, course, or track, in which anything moves or has moved; route; passage; an established way; as, the path of a meteor, of a caravan, of a storm, of a pestilence. Also used figuratively, of a course of life or action.
n.
A towing path.
v. t.
To adorn, as the face, with a patch or patches.