Extremal trees with respect to number of (A, B, 2 C)-edge colourings

DOI10.1155/2015/463650zbMATH Open1347.05033OpenAlexW2195677420WikidataQ59111845 ScholiaQ59111845MaRDI QIDQ327737FDOQ327737

Authors: Krzysztof Piejko 

Publication date: 19 October 2016

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

Full work available at URL: https://doi.org/10.1155/2015/463650

Recommendations

• scientific article; zbMATH DE number 6823083
• Extremal \(H\)-colorings of trees and 2-connected graphs
• On an extremal problem for colored trees
• Maximum colored trees in edge-colored graphs
• Maximum properly colored trees in edge-colored graphs
• Edge-\(b\)-coloring trees
• Extremal problems on detectable colorings of trees
• A note on edge colorings and trees
• Trees with extremal numbers of \(k\)-dominating sets
• On characterizations of trees having large \((2, 0)\)-chromatic numbers

zbMATH Keywords

Fibonacci numbers in graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Title not available (Why is that?)
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Some useful combinatorial formulas for bosonic operators
• On the generalized Fibonacci and Pell sequences by Hessenberg matrices.
• On \(k\)-distance Pell numbers in 3-edge-coloured graphs
• The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers
• On Pell numbers and \((k_1A_1,k_2A_2,k_3A_3)\)-edge colouring in graphs.
• \((k,\alpha _{n-1})\)-Fibonacci numbers and \(P_k\)-matchings in multigraphs.
• Distance Fibonacci numbers, distance Lucas numbers and their applications.
• On the usual Fibonacci and generalized order-\(k\) Pell numbers.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hadamard Product of Certain Classes of Functions
• General approach in computing sums of products of binary sequences
• The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
• Generalized sequences and \(k\)-independent sets in graphs

Cited In (5)

• Maximizing and minimizing the number of generalized colorings of trees
• On Fibonacci numbers in edge coloured trees
• Extremal problems on detectable colorings of trees
• On an extremal problem for colored trees
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings

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