Results 281 to 290 of about 38,756 (312)

Line perfect graphs

Mathematical Programming, 1977
The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense. Line perfect graphs are characterized as those which contain no odd cycles of size larger than 3.
openaire   +1 more source

Game-perfect graphs

Mathematical Methods of Operations Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Perfect Graphs and Comparability Graphs

2016
The first use of graph theory is dated to 1735. Swiss mathematician and physicist, Leonhard Euler, formulated theorems and definitions related to graphs. Euler was inspired by a real problem regarding crossing bridges in Konigsberg (east Prussia, also known as Krolewiec, Kaliningrad).
openaire   +1 more source

Matching-perfect and cover-perfect graphs

Israel Journal of Mathematics, 1974
It is shown that a graphG has all matchings of equal size if and only if for every matching setλ inG, G\V(λ) does not contain a maximal open path of odd length greater than one, which is not contained in a cycle. (V(λ) denotes the set of vertices incident with some edge ofλ.) Subsequently edge-coverings of graphs are discussed.
openaire   +2 more sources

Perfect and precisely perfect fuzzy graphs

NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society, 2008
In this paper, we consider two different definitions of adjacency in fuzzy graph. Thus any graph theory concept that can be defined through adjacency can have two different variations in fuzzy graph theory. We demonstrate this fact through perfect graph and perfect graph theorem.
openaire   +1 more source

Perfection of glued graphs of perfect original graphs

A graph G is perfect if the chromatic number and the clique number have the same value for every of its induced subgraph. A glued graph results from combining two vertex-disjoint graphs by identifying nontrivial connected isomorphic subgraphs of both graphs. Such subgraphs are referred to as the clones.
openaire   +1 more source

Knowledge Graphs

ACM Computing Surveys, 2022
Aidan Hogan, Claudio Gutierrez, Sabrina Kirrane   +2 more
exaly  

Fundamentals and developments in fluorescence-guided cancer surgery

Nature Reviews Clinical Oncology, 2021
Friso Achterberg, Aimen Zlitni, Merlijn Hutteman   +2 more
exaly  

A guide to comprehensive phosphor discovery for solid-state lighting

Nature Reviews Materials, 2023
Shruti Hariyani, Małgorzata Sójka, Jakoah Brgoch   +2 more
exaly  

Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm

Nature Methods, 2021
Haoyu Cheng, Gregory T Concepcion, Xiaowen Feng   +2 more
exaly