On trees with a maximum proper partial 0-1 coloring containing a maximum matching
From MaRDI portal
Publication:2368934
DOI10.1016/j.disc.2005.12.019zbMath1086.05033OpenAlexW2036970706MaRDI QIDQ2368934
Publication date: 28 April 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.019
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ On disjoint matchings in cubic graphs ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ On edge-disjoint pairs of matchings ⋮ Characterization of a class of graphs related to pairs of disjoint matchings ⋮ Enumeration of BC-subtrees of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
Cites Work
This page was built for publication: On trees with a maximum proper partial 0-1 coloring containing a maximum matching
