A local independence number condition for n-extendable graphs

DOI10.1016/S0012-365X(98)00181-2MaRDI QIDQ1296992zbMATH OpenFDO

Authors Dingjun Lou

Publication date 9 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independence number\(n\)-extendable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On local and global independence numbers of a graph
• scientific article; zbMATH DE number 969186
• A local intersection condition for \(n\)-extendable graphs
• Independence number in n-extendable graphs
• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• Independence numbers of locally sparse graphs and a Ramsey type problem
• Local transformations of graphs preserving independence number
• scientific article; zbMATH DE number 825129
• Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability

Cites work

• scientific article; zbMATH DE number 15875 (Why is no real title available?)
• scientific article; zbMATH DE number 637272 (Why is no real title available?)
• scientific article; zbMATH DE number 969186 (Why is no real title available?)
• Extending matchings in graphs: A survey
• Graph theory
• N‐extendability of symmetric graphs
• On n-extendable graphs
• Toughness and triangle-free graphs

Cited in

(1)

• A local intersection condition for \(n\)-extendable graphs

This page was built for publication: A local independence number condition for \(n\)-extendable graphs

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