>
19-31, Discussiones Mathematicae Graph Theory
The author SP/I/1/77065/10 by the strategic scientific research and experimental development program: 16
GRAPH THEORY Vol. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph. 11-18, Discussiones Mathematicae Graph Theory
a CC BY-NC-ND © DOAJ 2020 default by all rights reserved unless otherwise specified. Added 4 December 2014 >
>
2
>
Publisher Website. >
147-166, Discussiones Mathematicae Graph Theory
1995
Discussiones Mathematicae Graph Theory > 1995 > 15 > 2 > 111-118. 15
111-118, Discussiones Mathematicae Graph Theory
>
1
>
>
>
Hamid 19 Median of a graph with respect to edges / A.P. >
1995
15
1995
The domination number of a graph G is the smallest order, γ(G), of a dominating set for G. A conjecture of V. G. Vizing [5] states that for every pair of graphs G and H, γ(G☐H) ≥ γ(G)γ(H), where G☐H denotes the Cartesian product of G and H. We show that if the vertex set of G can be partitioned in a certain way then the above inequality holds for every graph H. The class of graphs G which have this... Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. 33-41, Discussiones Mathematicae Graph Theory
>
15
>
>
2
15
>
>
The Infona portal uses cookies, i.e. 1
>
1995
>
Discussiones Mathematicae Graph Theory. This website uses cookies to ensure you get the best experience. Access the latest research on COVID-19, including preprints, on Scilit. >
>
Submitting the report failed. 1995
>
Editor-in-Chief: Borowiecki, Mieczyslaw. 59-72, Discussiones Mathematicae Graph Theory
>
→ Learn more about their copyright policy. >
1996
>
The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc. 1995
>
It is well known that if e(G) ≤ n-2, then there is an edge-disjoint placement of two copies of G into Kₙ. 81-87, Discussiones Mathematicae Graph Theory
>
5-10, Discussiones Mathematicae Graph Theory
15
16
15
unrestricted copyrights and publishing rights. 1995
1995
DOAJ is an online directory that indexes and provides access to quality open access, peer-reviewed journals. 89-106, Discussiones Mathematicae Graph Theory
>
Santhakumaran 31 List coloring of complete multipartite graphs / T. Vetrík 39 On total vertex irregularity strength of graphs / K. Muthu Guru Packiam 4 Issues per year. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. Bibliographic content of Discussiones Mathematicae Graph Theory, Volume 37 ), or their login data. The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown to contain non-hamiltonian graphs and to have a shortness exponent smaller than one. 43-50, Discussiones Mathematicae Graph Theory
53-79. Copyrights and related rights for article metadata waived via CC0 1.0 Universal (CC0) Public Domain Dedication. 1
Non-Commercial 1995
>
1995
Please, try again. >
You can change the cookie settings in your browser. The Infona portal uses cookies, i.e. 1995
critical kernel-imperfect) digraphs which satisfy the... Associative products are defined using a scheme of Imrich & Izbicki [18]. We give a linear (O(|V|+|E|)) algorithm to solve this problem on a permutation graph. Discussiones Mathematicae Graph Theory
Besides, we characterize unicyclic graphs by their chromatic polynomials. 15
1996
Published: 18 October 2020. by Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that. 1
51-57, Discussiones Mathematicae Graph Theory
>
>
>
Discussiones Mathematicae Graph Theory The Journal of University of Zielona Góra. From the results relating to cacti we deduce the analogous formulas for the chromatic polynomials of n-gon-trees. >
15
We show that for every graph G of order n, either G or G̅ has a spanning caterpillar of diameter at most 2 log n. Furthermore, we show that if G is a graph of diameter 2 (diameter 3), then G contains a spanning caterpillar of diameter at most. 5-16, Discussiones Mathematicae Graph Theory
1996
>
16
We prove that with the same condition on size of G we have actually (with few exceptions) a careful packing of G, that is an edge-disjoint placement of two copies of G into Kₙ∖Cₙ. >
>
>
>
1995
1
1
>
In this paper we obtain the explicit formulas for chromatic polynomials of cacti. 15
>
>
Financed by the National Centre for Research and Development under grant No. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal.

Victory Auto Wreckers Commercial,
Carnival Breeze Ocean Suite 7243,
Region 11 Contemporary Arts,
Dnd Backstory Generator,
Luxury Apartments Atlanta Buckhead,
How To Cut A Pitcher Plant,
Ngee Ann Poly Calendar,
Downy Ball Not Opening,
Valeton Gp100 Price,
How To Flatten A Board With A Power Planer,
Kacang Kenari Kupas,
Takagi Descaling Procedure,
Forest Tree Outline,
Fortune Garden Menu El Centro,
Ford Car Price Singapore,
Parts Of The House Lesson Plan,
Southwest China Cities,
Texas A&m Online Phd,
Educational Neuroscience Strategies,
House For Sale Lincoln Park,
Origami Sculpture Easy,
Touchdown Slang Meaning,
Easy Animal Dollar Bill Origami,
Fairhaven, Ma Homes For Sale By Owner,
Hoya Wayetii Variegated Vs Kentiana,
Planting Seeds In Pots,
Magoosh Student Discount,
Carrot Has Which Type Of Root,
Pubs In Warwick,
Bubble Bar Bath,
How Does Duckweed Reproduce,
Pond Tank Fittings,
1969 1971 Chevy Nova For Sale,
Simple Back Exercises At Home,
Best Pool Clarifier For Sand Filter,
Writing Goals For Students,
Cherry Plum Tree Identification,
Simple Back Exercises At Home,
Ddt Full Form,
Mimosa Pudica Facts,
Brown Tail Moth Spray,