Note on enumeration of labeled split graphs.

DOI10.14712/1213-7243.2015.112MaRDI QIDQ5248291zbMATH OpenOpenAlexFDO

Authors Vladislav Bína, Jiří Přibil

Publication date 6 May 2015

Published in Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14712/1213-7243.2015.112

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph enumerationlabeled graphsplit graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Split graphs: combinatorial species and asymptotics
• scientific article; zbMATH DE number 1522332
• Counting and enumerating unlabeled split-indifference graphs
• Enumeration of labelled essential graphs.
• scientific article; zbMATH DE number 1424850

Cited in

(8)

• Finding balance: split graphs and related classes
• Enumeration of difference graphs
• Split graphs: combinatorial species and asymptotics
• Enumeration of labelled essential graphs.
• Combinatorial enumeration of subdivisible graphs
• scientific article; zbMATH DE number 1522332 (Why is no real title available?)
• Counting and enumerating unlabeled split-indifference graphs
• Sampling unlabeled chordal graphs in expected polynomial time

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Note on enumeration of labeled split graphs.

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