On invariants of hereditary graph properties

Mihók, Peter; Semanišin, Gabriel

doi:10.1016/j.disc.2005.11.048

Search citation statements

Order By: Relevance

Paper Sections

Select...

General Results1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An invariant ρ(G) is monotone increasing (with respect to subgraphs) if H ⊆ G implies ρ(H) ≤ ρ(G), and monotone decreasing (with respect to subgraphs) if H ⊆ G implies ρ(H) ≥ ρ(G) (see, e.g., [7] for a study on graph invariants).…”

Section: General Resultsmentioning

confidence: 99%

On the \rho-subdivision number of graphs

Kemnitz¹,

Marangio²

2023

Discuss. Math. Graph Theory

View full text Add to dashboard Cite

For an arbitrary invariant ρ(G) of a graph G the ρ-subdivision number sd ρ (G) is the minimum number of edges of G whose subdivision results in a graph H with ρ(H) = ρ(G). Set sd ρ (G) = |E(G)| if such an edge set does not exist.In the first part of this paper we give some general results for the ρsubdivision number. In the second part we study this parameter for the chromatic number, for the chromatic index, and for the total chromatic number. We show among others that there is a strong relationship to the ρedge stability number for these three invariants. In the last part we consider a modification, namely the ρ-multiple subdivision number where we allow multiple subdivisions of the same edge.

show abstract

Section: General Resultsmentioning

confidence: 99%