Characterization of k-variegated graphs, \(k\geq 3\)

DOI10.1016/0012-365X(80)90264-2zbMath0458.05051OpenAlexW1963782598MaRDI QIDQ1151405

Medha Javdekar

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90264-2

zbMATH Keywords

independent edgesk-variegated graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Characterizations of 2-variegated graphs and of 3-variegated graphs
• A characterization of bivariegated trees

This page was built for publication: Characterization of k-variegated graphs, \(k\geq 3\)