Counting and enumerating unlabeled split-indifference graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 90560 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1522332 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3329638 (Why is no real title available?)
- A coding algorithm for Rényi trees
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- Algorithmic graph theory and perfect graphs
- Characterizing and edge-colouring split-indifference graphs
- Generating and counting unlabeled \(k\)-path graphs
- On the compatibility between a graph and a simple order
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- The On-Line Encyclopedia of Integer Sequences
- The Reduced Prüfer Code for Rooted Labelled k-Trees
- The total chromatic number of split-indifference graphs
Cited in
(4)
This page was built for publication: Counting and enumerating unlabeled split-indifference graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370830)