P4-Decomposition of Total Graphs

DOI10.1080/09720529.2014.903695zbMATH Open1495.05249OpenAlexW2050251691MaRDI QIDQ5069657FDOQ5069657

Authors: P. Chithra Devi, J. Paulraj Joseph 

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.903695

zbMATH Keywords

decompositiontotal graphpath decompositioncorona of graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graph theory
• A note on edge-decompositions of planar graphs
• P4-decompositions of regular graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• On \(P_4\)-decomposition of graphs
• A note on the cycle multiplicity of line-graphs and total graphs
• Title not available (Why is that?)

Cited In (8)

• P4-decompositions of regular graphs
• On the determination problem for \(P_{4}\)-transformation of graphs
• Title not available (Why is that?)
• \(C_{4p}\)-frame of complete multipartite multigraphs
• Edge domination in Boolean function graph B(L(G), NINC) of a graph
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: P₄-Decomposition of Total Graphs

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