scientific article; zbMATH DE number 5670545

zbMATH Open1199.05274MaRDI QIDQ3403701FDOQ3403701

Authors: Nini Xue 

Publication date: 12 February 2010

Title of this publication is not available (Why is that?)

Recommendations

• Dominating cliques in \(P_ 5\)-free graphs
• scientific article; zbMATH DE number 6410527
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
• Cliques in \(C_4\)-free graphs of large minimum degree
• Large cliques in \(C_4\)-free graphs
• Cliques in the union of \(C_4\)-free graphs
• Paired-domination in claw-free graphs with minimum degree at least four.
• Paired-domination in claw-free graphs with minimum degree at least four.
• On the clique-width of graph with few \(P_{4}\)'s
• \(P_4\)-domination in minimal imperfect graphs

zbMATH Keywords

line graphHamilton cycledominating clique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cited In (3)

• MULTISITE COORDINATED DELAYED FEEDBACK FOR AN EFFECTIVE DESYNCHRONIZATION OF NEURONAL NETWORKS
• Title not available (Why is that?)
• Cliques in \(C_4\)-free graphs of large minimum degree

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3403701)