Search results
From MaRDI portal
- chordal graphs 2023-11-27 Paper The scattering number of strictly chordal graphs: linear time determination 2022-06-01 Paper Block-indifference graphs: characterization...10 bytes (22 words) - 10:17, 11 December 2023
- in \(P_4\)-comparability graphs 1999-05-31 Paper On clique-complete graphs 1998-09-07 Paper On edge-colouring indifference graphs 1998-07-22 Paper https://portal...10 bytes (20 words) - 22:07, 10 December 2023
- the edge colouring of reduced indifference graphs. 2003-08-17 Paper Recognizing clique graphs of directed edge path graphs 2003-03-09 Paper https://portal...10 bytes (16 words) - 22:07, 10 December 2023
- Publication Type Maximal independent sets in grid graphs 2017-03-16 Paper Maximal independent sets in caterpillar graphs 2012-03-19 Paper https://portal.mardi4nfdi...10 bytes (18 words) - 22:03, 12 December 2023
- 2015-04-16 Paper Gridline indifference graphs 2007-02-19 Paper https://portal.mardi4nfdi.de/entity/Q3408841 2006-11-15 Paper Gridline graphs: A review in two dimensions...10 bytes (18 words) - 03:31, 13 December 2023
- Paper Non-inclusion and other subclasses of chordal graphs 2019-12-30 Paper Block-indifference graphs: characterization, structural and spectral properties...10 bytes (16 words) - 10:16, 11 December 2023
- packing problem 2008-06-05 Paper Packing triangles in low degree graphs and indifference graphs 2008-03-18 Paper...10 bytes (16 words) - 06:32, 13 December 2023
- cases of connected graphs 2022-03-09 Paper Integer Laplacian eigenvalues of chordal graphs 2021-02-17 Paper Block-indifference graphs: characterization...10 bytes (18 words) - 04:39, 12 December 2023
- Paper On total and edge coloring some Kneser graphs 2022-08-26 Paper On edge-colouring indifference graphs 2022-08-16 Paper A general method for forbidden...10 bytes (22 words) - 10:24, 8 December 2023
- Publication Date of Publication Type Vector domination in split-indifference graphs 2019-12-19 Paper...10 bytes (18 words) - 17:15, 6 October 2023
- multiple broadcasting 1993-08-23 Paper Optimal greedy algorithms for indifference graphs 1993-06-29 Paper https://portal.mardi4nfdi.de/entity/Q4021770 1993-01-17...10 bytes (18 words) - 10:52, 6 October 2023
- ()-linear graphs 2007-05-29 Paper Old and new results on algebraic connectivity of graphs 2007-04-18 Paper Walks and regular integral graphs 2007-04-18...10 bytes (22 words) - 00:08, 12 December 2023
- for some operations of graphs 2023-06-22 Paper \(A_\alpha\)-spectrum of a firefly graph 2022-04-27 Paper Laplacian integral graphs with a given degree sequence...10 bytes (18 words) - 12:28, 6 October 2023
- Dominating cliques in graphs 1990-01-01 Paper Dominating cliques in graphs 1990-01-01 Paper On dimensional properties of graphs 1989-01-01 Paper Maximam...10 bytes (18 words) - 04:14, 7 October 2023
- isomorphism of graphs with few P4s 2024-02-28 Paper Asteroidal triple-free graphs 2024-01-05 Paper On domination elimination orderings and domination graphs 2024-01-05...10 bytes (16 words) - 20:14, 8 December 2023
- low degree graphs and indifference graphs 2008-03-18 Paper A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs 2008-02-20 Paper...10 bytes (17 words) - 17:58, 9 December 2023
- 2022-07-18 Paper \(P_3\)-hull number of graphs with diameter two 2022-04-27 Paper On clique‐inverse graphs of graphs with bounded clique number 2022-03-31...10 bytes (16 words) - 20:46, 9 December 2023
- Computing the boxicity of a graph by covering its complement by cointerval graphs 1983-01-01 Paper A characterization of competition graphs of arbitrary digraphs...10 bytes (19 words) - 01:35, 9 December 2023
- \(P_4\)-comparability graphs 1999-05-31 Paper On clique-complete graphs 1998-09-07 Paper Characterizing and edge-colouring split-indifference graphs 1998-06-02 Paper...10 bytes (19 words) - 16:28, 9 December 2023
- de/entity/Q2768053 2001-01-01 Paper Characterizing and edge-colouring split-indifference graphs 1998-06-02 Paper A trust region method for zero-one nonlinear programming...10 bytes (18 words) - 01:50, 11 December 2023