Cores and shells of graphs.

DOI10.21136/MB.2013.143229MaRDI QIDQ4922250zbMATH OpenOpenAlexFDO

Authors Allan Bickle

Publication date 29 May 2013

Full work available at URL http://mb.math.cas.cz/mb138-1/

zbMATH Keywords

\(k\)-core\(k\)-shellcoloringcore numberdominationmaximal induced subgraphmonocoremonocore graphsstructural aspects of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 434696
• Degree sequences of monocore graphs
• scientific article; zbMATH DE number 7692340
• Size and connectivity of the \(k\)-core of a random graph
• Constructions of 3-Colorable Cores

Cited in

(10)

• Degree sequences of monocore graphs
• scientific article; zbMATH DE number 434696 (Why is no real title available?)
• Core decomposition, maintenance and applications
• scientific article; zbMATH DE number 861323 (Why is no real title available?)
• A short proof of Brooks’ Theorem for vertex arboricity
• Extremal decompositions for Nordhaus-Gaddum theorems
• scientific article; zbMATH DE number 7692340 (Why is no real title available?)
• Zero forcing with random sets
• Multicore graphs: characterization and properties
• The core of a graph

This page was built for publication: Cores and shells of graphs.

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