Results 41 to 50 of about 18,582 (315)
Perfectly colorable graphs [PDF]
Information Processing Letters, 2011 We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $ω(H)$ many colors where $ω(H)$ is the clique number of $H$. A graph is perfectly colorable if it admits a perfect coloring.
openaire +2 more sources
IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR
Jurnal Informatika, 2010 This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah +5 more
doaj +1 more source
Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms
, 2011 It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +4 more
core +1 more source
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source
Online Graph Coloring for $k$-Colorable Graphs
CoRRWe study the problem of online graph coloring for $k$-colorable graphs. The best previously known deterministic algorithm uses $\widetilde{O}(n^{1-\frac{1}{k!}})$ colors for general $k$ and $\widetilde{O}(n^{5/6})$ colors for $k = 4$, both given by Kierstead in 1998. In this paper, we finally break this barrier, achieving the first major improvement in
Ken-ichi Kawarabayashi +2 more
openaire +2 more sources
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +1 more source