3204 search results - page 265 / 641 » The b-chromatic Number of a Graph |
95
Voted
TIT
2008
15 years 20 days ago
2008
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
73
Voted
JGT
2007
15 years 20 days ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
243
click to vote
AAIM
2011
Springer
14 years 4 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
87
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
82
Voted
DM
2010
15 years 25 days ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...