A local independence number condition for n-extendable graphs

DOI10.1016/S0012-365X(98)00181-2zbMATH Open0928.05050MaRDI QIDQ1296992FDOQ1296992

Authors: Dingjun Lou 

Publication date: 9 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• Graph theory
• On n-extendable graphs
• Extending matchings in graphs: A survey
• N‐extendability of symmetric graphs
• Title not available (Why is that?)
• Toughness and triangle-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)