Counting and enumerating unlabeled split–indifference graphs

DOI10.1142/S1793830917500550zbMath1373.05088OpenAlexW2735538877MaRDI QIDQ5370830

Christina Fraga Esteves Maciel Waga, Lilian Markenzon

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500550

zbMATH Keywords

countingcodesplit-indifference graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (2)

Vector domination in split-indifference graphs ⋮ Block-indifference graphs: characterization, structural and spectral properties

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The total chromatic number of split-indifference graphs
• Generating and counting unlabeled \(k\)-path graphs
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
• A coding algorithm for Rényi trees
• Characterizing and edge-colouring split-indifference graphs
• Algorithmic graph theory and perfect 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 Reduced Prüfer Code for Rooted Labelled k-Trees
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Counting and enumerating unlabeled split–indifference graphs