Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs

DOI10.1007/s10288-008-0091-7zbMath1181.05082OpenAlexW2009160258MaRDI QIDQ1041408

Ugo Pietropaoli

Publication date: 2 December 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-008-0091-7

zbMATH Keywords

stable setisomorphismcoloringcirculant graphclaw free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)

Cites Work

• Matching theory
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
• A solution of the isomorphism problem for circulant graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs