Results 331 to 340 of about 973,826 (351)
Some of the next articles are maybe not open access.
Mathematical Programming, 1978
Line-perfect graphs have been defined by L.E. Trotter as graphs whose line-graphs are perfect. They are characterized by the property of having no elementary odd cycle of size larger than 3. L.E. Trotter showed constructively that the maximum cardinality of a set of mutually non-adjacent edges (matching) is equal to the minimum cardinality of a ...
openaire +2 more sources
Line-perfect graphs have been defined by L.E. Trotter as graphs whose line-graphs are perfect. They are characterized by the property of having no elementary odd cycle of size larger than 3. L.E. Trotter showed constructively that the maximum cardinality of a set of mutually non-adjacent edges (matching) is equal to the minimum cardinality of a ...
openaire +2 more sources
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
On chromatic number and perfectness of fuzzy graph
Information Sciences, 2022Madhumangal Pal, Sreenanda Raut
exaly
Perfect 2-colorings of Hamming graphs
Journal of Combinatorial Designs, 2021Evgeny A Bespalov +2 more
exaly
On some graph classes related to perfect graphs: A survey
Discrete Applied Mathematics, 2020Martín Darío Safe +2 more
exaly
Characterization of subgroup perfect codes in Cayley graphs
Discrete Mathematics, 2020Binzhou Xia, Jiyong Chen, Yanpeng Wang
exaly
Perfect Codes in Cayley Graphs
SIAM Journal on Discrete Mathematics, 2018Sanming Zhou, Binzhou Xia
exaly