A clique-difference encoding scheme for labelled \(k\)-path graphs

DOI10.1016/j.dam.2008.05.015zbMath1156.05051OpenAlexW2154391310MaRDI QIDQ1003468

P. R. C. Pereira, Oswaldo Vernet, Lilian Markenzon

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.015

zbMATH Keywords

\(k\)-treecliquecodeword\(k\)-path graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Generating and counting unlabeled \(k\)-path graphs ⋮ Unnamed Item ⋮ On the characteristic polynomial of the power of a path. ⋮ k-separator chordal graphs: leafage and subfamilies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coding algorithm for Rényi trees
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Subclasses of \(k\)-trees: characterization and recognition
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• Graph Classes: A Survey
• Properties and characterizations of k ‐trees

This page was built for publication: A clique-difference encoding scheme for labelled \(k\)-path graphs