On seed graphs with more than two components

DOI10.1016/S0012-365X(00)00231-4MaRDI QIDQ5936022zbMATH OpenFDO

Authors Dalibor Fronček

Publication date 16 April 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00231-4

zbMATH Keywords

isomorphic survivor graphslocal properties of graphsseed graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• On seed graphs with two components
• Publication:4505008
• On the Seidel integral complete multipartite graphs
• Graphs of separability at most two: structural characterizations and their consequences
• On the separability of graphs
• On separated graphs with certain regularity conditions
• On the plurality of graphs
• ON CO-SEGREGATED GRAPHS
• On multiaspect graphs
• On the number of components of a graph

Cited in

(3)

• On seed graphs with two components
• scientific article; zbMATH DE number 1509534 (Why is no real title available?)
• scientific article; zbMATH DE number 975407 (Why is no real title available?)

This page was built for publication: On seed graphs with more than two components

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